Symbol-by-symbol APP decoding of the Golay code and iterative decoding of concatenated Golay codes

IEEE Transactions on Information Theory

Volumn 45, Issue 7, 1999, Pages 2558-2562

  Li, Ping ^a,b   Yeung, Kwan L ^a,b  

^a IEEE   (Hong Kong)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

CONCATENATED GOLAY CODES; COSET DECODING; TURBO CODES; TURBO DECODING;

ALGORITHMS; DECODING; ITERATIVE METHODS; MATRIX ALGEBRA;

CODES (SYMBOLS);

EID: 0033316802     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.796407     Document Type: Article

References (17)

1. L. 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.
2. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding turbo-codes," in Proc. IEEE ICC-93, May 1993, pp. 1064-1070.
3. J. Hagenauer, E. Offer, and L. Papke, "Iterative decoding of binary block and convolutional codes," IEEE Trans. Inform. Theory, vol. 42, pp. 429-445, Mar. 1996.
4. P. Jung, "Comparison of turbo-code decoders applied to short frame transmission systems," IEEE J. Select. Areas Commun., vol. 14, pp. 530-537, Apr. 1996.
5. D. J. Muder, "Minimal trellises for block codes," IEEE Trans. Inform. Theory, vol. 34, pp. 1049-1053, Sept. 1988.
6. J. B. Anderson and S. M. Hladik, "tail-biting MAP decoders," IEEE J. Select. Areas Commun., vol. 16, pp. 297-302, Feb. 1998.
7. A. R. Calderbank, G. D. Forney, Jr., and A. Vardy, "Minimal tail-biting trellises: The Golay code and more," IEEE Trans. Inform. Theory, vol. 45, pp. 1435-1455, July 1999.
8. V. Pless, "Decoding the Golay codes," IEEE Trans. Inform. Theory, vol. IT-32, pp. 561-576, July 1986.
9. A. Vardy and Y. Be'ery, "More efficient soft decoding of the Golay codes," IEEE Trans. Inform. Theory, vol. 37, pp. 667-672, May 1991.
10. 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. IT-32, pp. 41-50, Jan. 1986.
11. 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, pp. 963-975, Sept. 1989.
12. O. Amrani, Y. Be'ery, A. Vardy, F. W. Sun, and C. A. van Tilborg, "The Leech lattice and Golay code: Bounded distance decoding and multilevel construction," IEEE Trans. Inform. Theory, vol. 40, pp. 1030-1043, July 1994.
13. F. M. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, vols. I/II. Amsterdam, The Netherlands: North-Holland, 1977.
14. P. Robertson, "Illuminating the structure of code and decoder of parallel concatenated recursive systematic (turbo) codes," in Proc. GLOBECOM'94, Dec. 1994, pp. 1298-1303.
15. N. Wiberg, H. A. Loeliger, and R. Kotter, "Codes and iterative decoding on general graphs," Euro. Trans. Telecommun., vol. 6, pp. 513-526, Sept. 1995.
16. 24 code," in Proc. IEEE 1997 Int. Conf. Communications, June 1997, pp. 1366-1370.
17. Li Ping and S. Chan, "Iterative decoding of concatenated Hadamard codes," in Proc. IEEE 1998 Int. Conf. Communications, June 1998, pp. 136-140.