Simple MAP decoding of first-order Reed-Muller and hamming codes

IEEE Transactions on Information Theory

Volumn 50, Issue 8, 2004, Pages 1812-1818

  Ashikhmin, Alexei ^a   Litsyn, Simon ^b  

^a IEEE   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY CODES; BLOCK CODES; CODING ERRORS; COMPUTATIONAL COMPLEXITY; DECODING; MATHEMATICAL TRANSFORMATIONS; MATRIX ALGEBRA; PROBABILITY; THEOREM PROVING; TRELLIS CODES;

BAHL-COCKE-JELINEK-RAVIV ALGORITHM; FAST HADAMARD TRANSFORMS; HAMMING CODES; REED-MULLER CODES;

ENCODING (SYMBOLS);

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

References (27)

1. A. Ashikhmin and S. Litsyn, "Quasi-optimal biorthogonal-code decoding algorithms" (in Russian), Radioelectronica, vol. 31, no. 11, pp. 30-34, 1988. English translation in Radio Electron. Commun. Syst., vol. 31, no. 11, pp. 26-30, 1988.
2. A. Ashikhmin, "A list algorithm for locating the maximal element in a Walsh spectrum" (in Russian), Radioelectronica, vol. 32, no. 3, pp. 15-22, 1990. English translation in Radio Electron. Commun. Syst., vol. 32, 11, pp. 37-41, 1990.
3. A. Ashikhmin, "Fast decoding of first order Reed-Muller and related codes," Des., Codes Cryptogr., vol. 7, pp. 187-215, 1996.
4. A. Ashikhmin, "Fast decoding of nonbinary orthogonal codes," Applic. Algebra in Eng., Commun. Comput., vol. 7, no. 4, pp. 299-308, 1996.
5. L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inform. Theory, vol. IT-20, pp. 284-287, Mar. 1974.
6. Y. Be'ery and J. Snyders, "Optimal soft decision block decoders based on fast hadamard transform," IEEE Trans. Inform. Theory, vol. IT-32, pp. 355-364, May 1986.
7. P. Delsarte, J.-M. Goethals, and F. J. MacWilliams, "On generalized Reed-Muller codes and their relatives," Inform. Contr., vol. 16, pp. 403-442, 1974.
8. M. Fossorier and S. Lin, "Soft-decision decoding of linear block codes based on ordered statistics," IEEE Trans. Inform. Theory, vol. 41, pp. 1379-1396, Sept. 1995.
9. C. R. P. Hartman and L. D. Rudolph, "An optimum symbol-by-symbol decoding rule for linear codes," IEEE Trans. Infrm. Theory, vol. IT-22, pp. 514-517, Sept. 1976.
10. D. Gazelle and J. Snyders, "Reliability-based code-search algorithms for maximum-likelihood decoding of block codes," IEEE Trans. Inform. Theory, vol. 43, pp. 239-249, Jan. 1997.
11. R. R. Green, "A serial orthogonal decoder," JPL Space Programs Summary, vol. 37-39-IV, pp. 247-253, 1966.
12. I. J. Good, "The interaction algorithm and practical Fourier analysis," J. Roy. Statist. Soc. (London), vol. B-20, pp. 361-372, 1958.
13. I. Grushko, "Majority-logic decoding of generalized Reed-Muller codes" (in Russian), Probl. Pered. Inform., vol. 26, no. 3, pp. 12-21, 1990. English translation in Probl. Inform. Transm., vol. 26, pp. 189-196, 1990.
14. S. A. Hirst, B. Honary, and G. Markarian, "Fast chase algorithm with an application in turbo decoding," IEEE Trans. Commun., vol. 49, pp. 1693-1699, Oct. 2001.
15. T. Kasami, S. Lin, and W. Peterson, "New generalizations of the Reed-Muller codes, Part 1: Primitive codes," IEEE Trans. Inform. Theory, vol. IT-14, pp. 189-199, Mar. 1968.
16. T. Kasami, T. Takata, T. Fujiwara, and S. Lin, "On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes," IEEE Trans. Inform. Theory, vol. 39, pp. 242-245, Jan. 1993.
17. T. Kasami, "On complexity of trellis structure of linear block codes," IEEE Trans. Inform. Theory, vol. 39, pp. 1057-1064, Jan. 1993.
18. S. Litsyn, G. Mikhailovskaya, E. Nemirovsky, and O. Shekhovtsov, "Fast decoding of first order Reed-Muller codes in the Gaussian channel," Probl. Contr. Inform. Theory, vol. 14, no. 3, pp. 189-201, 1985.
19. M. Meiler, J. Hagenauer, A. Schmidbauer, and R. Herzog, "Iterative decoding in the uplink of the CDMA-system IS-95(A)," in Proc. Int. Symp. Turbo Codes, Brest, France, 1997, pp. 208-211.
20. A. M. Michelson and D. F. Freeman, "Viterbi decoding of the (63, 57) Hamming code - Implementation and performance results," IEEE Trans. Commun., vol. 43, pp. 2653-2656, Nov. 1995.
21. H. Miyakawa and T. Kaneko, "Decoding algorithm of error-correcting codes by use of analog weights," Electron. Commun. Japan, vol. 58, no. 1, pp. 18-27, 1975.
22. D. E. Muller, "Application of boolean algebra to switching circuit design and to error detection," IEEE Trans. Comput., vol. C-3, pp. 6-12, 1954.
23. R. Pyndiah, "Near optimum decoding of product codes: Block turbo codes," IEEE Trans. Commun., vol. 46, pp. 1003-1010, Aug. 1998.
24. 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.
25. J. Snyders, "Reduced lists of error patterns for maximum likelihood soft decoding," IEEE Trans. Inform. Theory, vol. 37, pp. 1194-1200, July 1991.
26. C.-E. Sundberg, "Asymptotically optimal soft decision decoding algorithms for Hamming codes," Electron. Lett., vol. 13, no. 2, pp. 38-40, 1977.
27. X. Wang and S. Wicker, "The BCJR trellis and trellis decoders for some BCH codes," Appl. Algebra Eng. Commun. Comput., vol. 9, no. 6, pp. 521-546, 1999.