Iterative min-sum decoding of tail-biting codes

1998 Information Theory Workshop, ITW 1998

Volumn , Issue , 1998, Pages 68-69

  Aji, S ^a   Horn, G ^a   McEliece, R ^a   Xu, Meina ^a  

^a California Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); INFORMATION THEORY; SIGNAL TO NOISE RATIO; TURBO CODES;

GAUSSIAN CHANNELS; MIN-SUM; MIN-SUM DECODING; MINIMUM DISTANCE; PERRON-FROBENIUS THEOREM; SEMI-RING; TAILBITING CODE; UNION BOUNDS;

ITERATIVE DECODING;

EID: 84938834840     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.1998.706439     Document Type: Conference Paper

References (8)

1. S. M. Aji, G. B. Horn, and R. J. McEliece, "On the convergence of iterative decoding on graphs with a single cycle," Proc. CISS 1998 (Princeton, N.J., March 1998).
2. S. M. Aji and R. J. McEliece, "The generalized distributive law," preliminary versions presented at 1S1T97 and ISCTA9T. Current version available at www. systems. caltech . edufEE/Faculty/rjmf.
3. J. B. Anderson and S. M. Hiadik, "Tail-biting MAP decoders," IEEE J. Select. Areas Comm., vol. 16, no. 2 (Feb. 1998).
4. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo-codes." Proc. IEEE lest. Comm. Conf., (Geneva, Switzerland, 1993), pp. 1064-1070.
5. A. R. Calderbank, G. D. Forney, Jr., and A. Vardy, "Minimal tail-hiting trellises: the Golay code and more." submitted to IEEE Thzns. Inform. Theory.
6. G. D. Forney, Jr., F. R. Kschischang, and B. Marcus, "Iterative decoding of tail-biting trellises," presented at 1998 Information Theory Workshop. San Diego: Feb. 9-11, 1998.
7. D. Lind and B. Marcus, Symbolic Dynamics and Coding. Cambridge, England: Cambridge University Press, 1995.
8. Y. Weiss, "Belief propagation and revision in networks with loops." M.I.T. Al. Memo no. 1616, November 1997. (Can be retrieved by anonymous ftp from publications.ai.Init.edu.)