Fast decoding algorithms for first order Reed-Muller and related codes

Designs, Codes, and Cryptography

Volumn 7, Issue 3, 1996, Pages 187-214

  Ashikhmin, Alexey E ^a   Litsyn, Simon N ^b  

^a INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Decoding algorithms; First order Reed Muller codes; The Nordstrom Robinson code

Indexed keywords

EID: 4043049921     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf00124511     Document Type: Article

References (25)

1. J. -P. Adoul, Fast ML decoding algorithm for the Nordstrom- Robinson code, IEEE Trans. Inform. Theory, Vol. IT-33 (1987) pp. 931-933.
2. A. Ashikhmin, A. Dmitriyev, S. Litsyn and S. Portnoy, Patent USSR, No 4433980 (1988).
3. A. Ashikhmin and S. Litsyn, Analysis of quasi-optimal decoding algorithms of biorthogonal codes, Radioelectronica, Vol. 31, No. 11 (1988) pp. 30-34 ( in Russian).
4. A. Ashikhmin and S. Litsyn, Fast decoding algorithms for first order Reed-Muller and related codes, Tel-Aviv University, Report EE-93-2 (1993).
5. A. Ashikhmin and S. Litsyn, List algorithm for search of the maximal element of Walsh transform, Radioelectronica, Vol. 32, No. 3 (1990) pp. 15-22 (In Russian).
6. Y. Be'ery and J. Snyders, Optimal soft decision block decoders based on fast Hadamard transform, IEEE Trans. Inform. Theory, Vol. IT-32 (1986) pp. 355-364.
7. E. R. Berlekamp, The technology of error-correcting codes, Proc. IEEE, Vol. 68 (1980) pp. 564-593.
8. E. Berlekamp and L. R. Welch, Weight distributions of the cosets of the (32,6) Reed-Muller code, IEEE Trans. Inform. Theory, Vol. IT-18 (1972) pp. 203-207.
9. J. H. Conway and N. J. A. Sloane, Fast quantizing and decoding algorithms for lattice quantizers and codes, IEEE Trans. Inform. Theory, Vol. IT-28 (1982) pp. 272-232.
10. J. H. Conway, N. J. A. Sloane, Soft decoding techniques for codes and lattices, including the Golay code and the Lccch lattice, IEEE Trans. Inform. Theory, Vol. IT 32, No. 1 (1986) pp. 41-50.
11. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups, Springer-Verlag, New York (1988).
12. G. D. Forney, Jr., Coset codes II: Binary lattices and related codes, IEEE Trans. Inform. Theory, Vol. IT-34 (1988) pp. 1152-1187.
13. S. W. Golomb, ed., Digital Communications with Space Applications, Prentice-Hall, Englewood Cliffs, NJ (1964).
14. R. R. Green, A serial orthogonal decoder, JPL Space Programs Summary, Vol. 37-39-IV (1966) pp. 247-253.
15. C. M. Hackett, An efficient algorithm for soft decision decoding of the (24,12) extended Golay code, IEEE Trans. Commun., Vol. Com-29 (1981) pp. 909-911,
16. C. M. Hackett, IEEE Trans. Commun., Vol. Com-30 (1982) p. 554.
17. S. Litsyn, G. Mikhailovskaya, E. Nemirovsky and O. Shekhovtsov, Fast decoding of first order Reed-Muller codes in the Gaussian channel, Problems of Control and Information Theory, Vol. 14, No. 3 (1985) pp. 189-201.
18. S. Litsyn and O. Shekhovtsov, Fast decoding algorithm for first order Reed-Muller codes, Problems of Information Transmission, Vol. 19, No. 2 (1983) pp. 3-7.
19. J. A. Maiorana, A classification of the cosets of the Reed-Muller code ℛ (1, 6), Mathematics of Computation, Vol. 57, No. 195 (1991) pp. 403-414.
20. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-correcting Codes, North-Holland, Amsterdam, The Netherlands (1977).
21. H. J. Manley, H. F. Mattson and J. R. Schatz, Some applications of Good's theorem, IEEE Trans. Inform. Theory, Vol. IT-26 (1980) pp. 475-476.
22. V. Pless, Decoding the Golay codes, IEEE Trans. Inform. Theory, Vol. IT-32 (1986) pp. 561-567.
23. N. J. A. Sloane and R. J. Dick, On the enumeration of cosets of first order Reed-Muller codes, Proc. IEEE Int. Conf. Communications, Vol. 7 (1971) 36-2-36-6.
24. J. Snyders and Y. Be'ery, Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes, IEEE Trans. Inform. Theory, Vol. IT-35 (1986) pp. 963-975.
25. J. Wolfmann, A permutation decoding of the (24,12,8) Golay code, IEEE Trans. Inform. Theory, Vol. IT-29 (1983) pp. 748-750.