Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Symposium on Information Theory (ISIT)

Optimal two-level q-ary unequal error control codes

Haruhiko Kaneko, Eiji Fujiwara

Published Jan 1, 2003• 0 citations
Publisher
DOI
10.1109/isit.2003.1228229

Related papers

Optimal Two-Level q-Ary Unequal Error Control Codes

Encoding Process

•Jan 1, 2003•0 citations

Optimal Two-Level q-Ary Unequal Error Control Codes

晴彦 金子, Haruhiko Kaneko, 英二 藤原 +1 more

•Jun 1, 2003•0 citations

Error detecting codes for the q-ary symmetric channel

Series on coding theory and cryptology•Apr 1, 2007•0 citations

Q-ary Error-Correcting Codes with Feedback

Christian Deppe

•Feb 2, 2019•0 citations

A large automorphism group decreases the number of computations in the construction of an optimal encoder/decoder pair for linear block code

Ludo M. G. M. Tolhuizen, W.J. Van Gils

For a linear block code it is shown how the number of computations needed for the determination of an optimal encoder/decoder pair can be reduced by using the code's automorphism group. Furthermore, it is shown that the use of an unequal-error-protection-optical generator matrix and a minimum-weight coset leader decoder is suboptimal for a q-ary symmetry channel, but their determination needs less computational effort.>

IEEE Transactions on Information Theory•Mar 1, 1988•7 citations

New results on self-orthogonal unequal error protection codes

Zhi Chen, Pingzhi Fan, Fan Jin

A lower bound on the length of binary self-orthogonal unequal error protection (UEP) codes is derived, and two design procedures for constructing optimal self-orthogonal UEP codes are proposed. With this lower bound, known self-orthogonal UEP codes can be evaluated. It is pointed out that, for given values of minimum distance and code rate, the self-orthogonal codes must be relatively long, so optimal self-orthogonal codes are not optimal in general. But self-orthogonal codes can be implemented simply, and they have error-correcting capabilities beyond those guaranteed by their minimum distance. These properties can be viewed as a partial compensation for using self-orthogonal codes.>

IEEE Transactions on Information Theory•Jan 1, 1990•9 citations
A lower bound on the length of binary self-orthogonal unequal error protection (UEP) codes is derived, and two design procedures for constructing optimal self-orthogonal UEP codes are proposed. With this lower bound, known self-orthogonal UEP codes can be evaluated. It is pointed out that, for given values of minimum distance and code rate, the self-orthogonal codes must be relatively long, so optimal self-orthogonal codes are not optimal in general. But self-orthogonal codes can be implemented simply, and they have error-correcting capabilities beyond those guaranteed by their minimum distance. These properties can be viewed as a partial compensation for using self-orthogonal codes.>