Recursive decoding and its performance for low-rate Reed-Muller codes

IEEE Transactions on Information Theory

Volumn 50, Issue 5, 2004, Pages 811-823

  Dumer, Ilya ^a  

^a University of California Riverside   (United States)

Author keywords

Decoding threshold; Plotkin construction; Recursive decoding; Reed Muller (RM) codes

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; BOUNDARY CONDITIONS; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; ERROR CORRECTION; POLYNOMIALS;

NONEXPONENTIAL COMPLEXITY; PLOTKIN CONSTRUCTION; RECURSIVE DECODING; REED-MULLER CODES;

DECODING;

EID: 2442696591     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2004.826632     Document Type: Article

References (18)

1. I. S. Reed, "A class of multiple error correcting codes and the decoding scheme," IEEE Trans. Inform. Theory, vol. IT-4, pp. 38-49, Sept. 1954.
2. S. N. Litsyn, "On decoding complexity of low-rate Reed-Muller codes" (in Russian), in Proc. 9th All-Union Conf. Coding Theory and Information Transmission, Odessa, U.S.S.R., 1988, pp. 202-204.
3. F. Hemmati, "Closest coset decoding of u|u+u| codes," IEEE J. Select. Areas Commun., vol. 7, pp. 982-988, Aug. 1989.
4. G. A. Kabatyanskii, "On decoding of Reed-Muller codes in semicontinuous channels," in Proc. 2nd Int. Workshop Algebraic and Combinatorial Coding Theory, Leningrad, U.S.S.R., 1990, pp. 87-91.
5. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1981.
6. R. E. Krichevskiy, "On the number of Reed-Muller code correctable errors," Dokl. Sov. Acad. Sci., vol. 191, pp. 541-547, 1970.
7. V. Sidel'nikov and A. Pershakov, "Decoding of Reed-Muller codes with a large number of errors," Probl. Inform. Transm., vol. 28, no. 3, pp. 80-94, 1992.
8. G. D. Forney, "Coset codes-Part II: Binary lattices and related codes," IEEE Trans. Inform. Theory, vol. 34, pp. 1152-1187, Sept. 1988.
9. W. Feller, An Introduction to Probability Theory and its Applications. New York: Wiley, 1971, vol. 2.
10. G. Schnabl and M. Bossert, "Soft-decision decoding of Reed-Muller codes as generalized multiple concatenated codes," IEEE Trans. Inform. Theory, vol. 41, pp. 304-308, Jan. 1995.
11. I. Dumer, "Recursive decoding of Reed-Muller codes," in Proc. 37th Allerton Conf. Communication, Control, and Computing, Monticello, IL, 1999, pp. 61-69.
12. I. Dumer and K. Shabunov, "Recursive constructions and their maximum likelihood decoding," in Proc. 38th Allerton Conf. Communication, Control, and Computing, Monticello, IL, 2000, pp. 71-80.
13. ____, "Recursive list decoding of Reed-Muller codes," in Information, Coding and Mathematics, M. Blaum, P. Farrell, and H. C. A van Tilborg, Eds. Boston, MA: Kluwer, pp. 279-298.
14. R. Lucas, M. Bossert, and A. Dammann, "Improved soft-decision decoding of Reed-Muller codes as generalized multiple concatenated codes," in Proc. ITG Conf. Source and Channel Coding, Aahen, Germany, 1998, pp. 137-141.
15. N. Stolte and U. Sorger, "Soft-decision stack decoding of binary Reed-Muller codes with look-ahead technique," in Proc. 7th Int. Workshop Algebraic and Combinatorial Coding Theory, Bansko, Bulgaria, 2000, pp. 293-298.
16. O. Goldreich and L. A. Levin, "A hard-core predicate for all one way functions," in Proc. 21 Annu. ACM Symp. Theory of Computation, Seattle, WA, 1989, pp. 25-32.
17. O. Goldreich, R. Rubinfeld, and M. Sudan, "Learning polynomials with queries: The highly noisy case," SIAM J. Discr. Math., vol. 13, no. 4, pp. 535-570, Nov. 2000.
18. R. R. Green, "A serial orthogonal decoder," JPL Space Programs Summary, vol. 37-39-IV, pp. 247-253, 1966.