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

Bounds and constructions for binary block codes correcting asymmetric or unidirectional errors

Jos H. Weber

Published Nov 23, 1989• 13 citations
OpenAlex

Related papers

Necessary and sufficient conditions on block codes correcting/detecting errors of various types

Jos H. Weber, Cornelis de Vroedt, Dick E. Boekee

Necessary and sufficient conditions are given for block codes to be capable of correcting up to t/sub 1/ symmetric errors, up to t/sub 2/ unidirectional errors, and up to t/sub 3/ asymmetric errors, as well as detecting from t/sub 1/+1 up to d/sub 1/ symmetric errors that are not of the unidirectional type, from t/sub 2/+1 up to d/sub 2/ unidirectional errors that are not of the asymmetric type, and from t/sub 3/+1 up to d/sub 3/ asymmetric errors. Many known conditions on block codes concerning error correction and/or detection appear as special cases of this general result. Further, some codes turn out to have stronger error correcting/detection capabilities than they were originally designed for.>

IEEE Transactions on Computers•Jan 1, 1992•17 citations

Methods for constructing and decoding block error-correcting codes

Abdullah A. Hashim

•Jan 1, 1974•0 citations

On asymmetric error-correcting codes

Robert Stephen Cunningham

•Mar 1, 1982•1 citation

On decoding algorithms for binary linear block codes

Bruce L. Montgomery

This dissertation investigates the complexity of minimum-distance decoding (MDD) algorithms for general binary linear block codes, and also investigates the use of such codes in constructing error correcting/detecting codes that are effective against both random and unidirectional errors. A new MDD algorithm is proposed, and its complexity is analyzed and compared to that of other such algorithms. The question of whether all good codes satisfy certain properties required for efficient implementation of the algorithm is also considered. The performance of decoding algorithms, with the information bit error rate as the criterion instead of the block error rate, is also studied. New decoding rules which can yield lower information bit error rates than the MDD rule are proposed and evaluated. A new class of binary codes is developed which corrects random errors and detects all unidirectional errors. These codes are obtained by appending a suffix to each codeword of a linear block code. To evaluate the efficiency of the new codes, a thorough comparison with the best previously obtained codes is made.

•Jan 1, 1987•0 citations

Some Features of Linear Codes that Correct Asymmetric Errors

R. R. Varshamov

Soviet physics. Doklady•Jan 1, 1965•12 citations

Constructions of pure asymmetric quantum alternant codes based on subclasses of Alternant codes

Jihao Fan, Hanwu Chen

In this paper, we construct asymmetric quantum error-correcting codes(AQCs) based on subclasses of Alternant codes. Firstly, We propose a new subclass of Alternant codes which can attain the classical Gilbert-Varshamov bound to construct AQCs. It is shown that when dx= 2, Z-parts of the AQCs can attain the classical Gilbert-Varshamov bound. Then we construct AQCs based on a famous subclass of Alternant codes called Goppa codes. As an illustrative example, we get three [[55, 6, 19/4]], [[55, 10, 19/3]], [[55, 15, 19/2]] AQCs from the well known [55, 16, 19] binary Goppa code. At last, we get asymptotically good binary expansions of asymmetric quantum GRS codes, which are quantum generalizations of Retter's classical results. All the AQCs constructed in this paper are pure.

arXiv:1401.3215•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2014•1 citation
Necessary and sufficient conditions are given for block codes to be capable of correcting up to t/sub 1/ symmetric errors, up to t/sub 2/ unidirectional errors, and up to t/sub 3/ asymmetric errors, as well as detecting from t/sub 1/+1 up to d/sub 1/ symmetric errors that are not of the unidirectional type, from t/sub 2/+1 up to d/sub 2/ unidirectional errors that are not of the asymmetric type, and from t/sub 3/+1 up to d/sub 3/ asymmetric errors. Many known conditions on block codes concerning error correction and/or detection appear as special cases of this general result. Further, some codes turn out to have stronger error correcting/detection capabilities than they were originally designed for.>
This dissertation investigates the complexity of minimum-distance decoding (MDD) algorithms for general binary linear block codes, and also investigates the use of such codes in constructing error correcting/detecting codes that are effective against both random and unidirectional errors. A new MDD algorithm is proposed, and its complexity is analyzed and compared to that of other such algorithms. The question of whether all good codes satisfy certain properties required for efficient implementation of the algorithm is also considered. The performance of decoding algorithms, with the information bit error rate as the criterion instead of the block error rate, is also studied. New decoding rules which can yield lower information bit error rates than the MDD rule are proposed and evaluated. A new class of binary codes is developed which corrects random errors and detects all unidirectional errors. These codes are obtained by appending a suffix to each codeword of a linear block code. To evaluate the efficiency of the new codes, a thorough comparison with the best previously obtained codes is made.
In this paper, we construct asymmetric quantum error-correcting codes(AQCs) based on subclasses of Alternant codes. Firstly, We propose a new subclass of Alternant codes which can attain the classical Gilbert-Varshamov bound to construct AQCs. It is shown that when dx= 2, Z-parts of the AQCs can attain the classical Gilbert-Varshamov bound. Then we construct AQCs based on a famous subclass of Alternant codes called Goppa codes. As an illustrative example, we get three [[55, 6, 19/4]], [[55, 10, 19/3]], [[55, 15, 19/2]] AQCs from the well known [55, 16, 19] binary Goppa code. At last, we get asymptotically good binary expansions of asymmetric quantum GRS codes, which are quantum generalizations of Retter's classical results. All the AQCs constructed in this paper are pure.