More Efficient Soft Decoding of The Golay Codes

IEEE Transactions on Information Theory

Volumn 37, Issue 3, 1991, Pages 667-672

  Vardy, Alexander ^a   Be'ery, Yair ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Golay codes; hexacode; Leech lattice; soft decision decoding

Indexed keywords

COMPUTER PROGRAMMING--ALGORITHMS;

BINARY CODES; GOLAY CODES; HEXACODE; LEECH LATTICES; MAXIMUM LIKELIHOOD DECODING; SOFT DECISION DECODING;

CODES, SYMBOLIC;

EID: 0026157330     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.79928     Document Type: Article

References (18)

1. A. D. Abbaszadeh and C. K. Rushforth, “VLSI implementation of a maximum likelihood decoder for the Golay(24,12) code,” IEEE J. Select. Areas Commun., vol. 6, pp. 558–565, 1988.
2. Y. Be'ery, B. Shahar, and J. Snyders, “Fast decoding of the Leech lattice,” IEEE J. Select. Areas Commun., vol. 7, pp. 959–967, 1989.
3. Y. Be'ery and J. Snyders, “Optimal soft decision block decoders based on fast Hadamard transform” IEEE Trans. Inform. Theory, vol. 32, no. 3, pp. 355–364, May 1986.
4. “New methods for soft-decision decoding of the Golay(24,12) code,” in Proc. IEEE 15th Conf. Elect. Eng. in Israel, TelAviv, Israel, 1987.
5. A. R. Calderbank and N. J. A. Sloane, “New trellis codes based on lattices and cosets,” IEEE Trans. Inform. Theory, vol. 33, no. 1, pp. 177–195, Jan. 1987.
6. J. H. Conway, “Hexacode and tetracode—MOG and MINIMOG,” in Computational Group Theory, M. D. Atkinson, Ed. New York: Academic Press, 1984, pp. 359–365.
7. J. H. Conway and N. J. A. Sloane, “Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice,” IEEE Trans. Inform. Theory, vol. 32, no. 1, pp. 41–50, Jan. 1986.
8. Sphere Packings, Lattices and Groups. New York: Springer-Verlag, 1988.
9. R. T. Curtis, “A new combinatorial approach to N24,” Math. Proc. Camb. Phil. Soc., vol. 79, pp. 25–41, 1976.
10. G. D. Forney, Jr., “Coset codes II: Binary lattices and related codes,” IEEE Trans. Inform. Theory, vol. 34, no. 5, pt. II, pp. 1152–1187, Sept. 1988.
11. “Coset codes III: Ternary codes, lattices, and trellis codes,” IEEE Trans. Inform. Theory, to appear.
12. “A bounded distance decoding algorithm for the Leech lattice, with generalizations,” IEEE Trans. Inform. Theory, vol. 35, pp. 906–909, July 1989.
13. D. E. Knuth, The Art of Computer programming, vol. 3: Sorting and Searching. Reading, MA: Addison-Wesley, 1973.
14. V. S. Pless, “On the uniqueness of the Golay codes,” J. Comb. Theory, vol. 5, pp. 215–228, 1968.
15. “Decoding the Golay codes,” IEEE Trans. inform. Theory, vol. 32, no. 4, pp. 561–567, July 1986.
16. E. M. Reingold, J. Nievergelt, and N. Deo, Combinatorial Algorithms: Theory and Practice. Englewood Cliffs, NJ: Prentice-Hall, 1977.
17. R. A. Silverman and M. Balser, “Coding for a constant data rate source,” IRE Trans. Inform. Theory, vol. 4, pp. 50–63, 1954.
18. 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. 35, no. 5, pp. 963–975, Sept. 1989.