On the complexity of minimum distance decoding of long linear codes
Barg, A.
Krouk, E.
van Tilborg, H.C.A.
Math. Sci. Res. Center, AT&T Bell Labs., Murray Hill, NJ;
This paper appears in: Information Theory, IEEE Transactions on
Publication Date: Jul 1999
Volume: 45,
Issue: 5
On page(s): 1392-1405
ISSN: 0018-9448
References Cited: 31
CODEN: IETTAW
INSPEC Accession Number: 6297664
Digital Object Identifier: 10.1109/18.771141
Current Version Published: 2002-08-06
Abstract
We suggest a decoding algorithm of q-ary linear codes, which we
call supercode decoding. It ensures the error probability that
approaches the error probability of minimum-distance decoding as the
length of the code grows. For n→∞ the algorithm has the
maximum-likelihood performance. The asymptotic complexity of supercode
decoding is exponentially smaller than the complexity of all other
methods known. The algorithm develops the ideas of covering-set decoding
and split syndrome decoding
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
