Title :
The complexity of hard-decision decoding of linear codes
Author :
Barg, A. ; Krouk, E. ; van Tilborg, H.C.A.
Author_Institution :
AT&T Bell Labs., Murray Hill, NJ, USA
fDate :
29 Jun-4 Jul 1997
Abstract :
We study a general method of minimum distance decoding of linear codes that instead of decoding the original code recovers the transmitted codeword by a number of decodings of shortened codes. We present an implementation of this method whose complexity for long linear codes has the smallest known value for any code rate R, 0<R<1
Keywords :
computational complexity; linear codes; maximum likelihood decoding; complexity; hard-decision decoding; linear codes; minimum distance decoding; shortened codes; transmitted codeword; Aerospace electronics; Computer science; Inspection; Laboratories; Linear code; Mathematics; Maximum likelihood decoding; Parity check codes; Partitioning algorithms; Size measurement;
Conference_Titel :
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location :
Ulm
Print_ISBN :
0-7803-3956-8
DOI :
10.1109/ISIT.1997.613259
