Title :
Ellipsoidal coverings and error-free search in maximum likelihood decoding
Author_Institution :
Coll. of Eng., California Univ., Riverside, CA, USA
Abstract :
For general linear (n, k) codes, maximum likelihood decoding is performed by random search of error-free k-subsets. The lowest known complexity of soft-decision decoding is obtained
Keywords :
binary codes; computational complexity; linear codes; maximum likelihood decoding; search problems; binary code; code rate; ellipsoidal coverings; error-free information-subsets; error-free search; general linear codes; maximum likelihood decoding; random search; soft-decision decoding complexity; Block codes; Maximum likelihood decoding;
Conference_Titel :
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-7803-5000-6
DOI :
10.1109/ISIT.1998.708972
