On the complexity of minimum distance decoding of long linear codes
From MaRDI portal
Publication:4701401
DOI10.1109/18.771141zbMath0960.94030OpenAlexW2131406406MaRDI QIDQ4701401
Henk C. A. van Tilborg, Alexander Barg, Evgueni Krouk
Publication date: 21 November 1999
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0d34465f08a3dd2708854d686f412a5b90aa3e24
\(q\)-ary linear codesdecoding algorithmerror probabilitycovering-set decodingminimum-distance decodingsplit syndrome decodingsupercode decoding
Related Items
Generalization of the Ball-Collision Algorithm, On the complexity of suboptimal decoding for list and decision feedback schemes, A commutative algebra approach to linear codes, LDPC codes from Singer cycles, Integer SEC-DED codes for low power communications, Key masking using biometry