DocumentCode
2054348
Title
Recursive and permutation decoding for Reed-Muller codes
Author
Dumer, Ilya ; Shabunov, Kirill
Author_Institution
California Univ., Riverside, CA, USA
fYear
2002
fDate
2002
Firstpage
146
Abstract
Two new recursive techniques are described for Reed-Muller (RM) codes and their subcodes. We show that these algorithms yield a substantial asymptotic gain over other nonexponential algorithms known for RM codes. Decoding performance is further enhanced by using intermediate code lists and permutation procedures.
Keywords
Reed-Muller codes; error correction codes; maximum likelihood decoding; RM codes; Reed-Muller codes; asymptotic gain; error-correcting threshold; intermediate code lists; maximum likelihood decoding; nonexponential algorithms; permutation decoding; recursive decoding; subcodes; Analytical models; Bit error rate; Cost function; Error analysis; Error correction codes; Gain; Maximum likelihood decoding; Maximum likelihood estimation; Probability; Protection;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN
0-7803-7501-7
Type
conf
DOI
10.1109/ISIT.2002.1023418
Filename
1023418
Link To Document