Optimal and near-optimal encoders for short and moderate-length tail-biting trellises

IEEE Transactions on Information Theory

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

  Stahl, Per ^b   Anderson, John B ^a,b   Johannesson, Rolf ^a,b  

^a IEEE

^b LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK CODES; ENCODING (SYMBOLS); ERROR CORRECTION; MATRIX ALGEBRA; TRELLIS CODES;

ERROR CORRECTION CODING; SHORT/MODERATE-LENGTH TAIL-BITING REPRESENTATIONS;

CONVOLUTIONAL CODES;

EID: 0033328413     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.796408     Document Type: Article

References (16)

1. G. Solomon and H. C. A. van Tilborg, "A connection between block and convolutional codes," SIAM J. Appl. Math., vol. 37, pp. 358-369.
2. H. H. Ma and J. K. Wolf, "On tailbiting codes," IEEE Trans. Commun., vol. COM-34, pp. 104-111, Feb. 1986.
3. R. Johannesson and K. Sh. Zigangirov, Fundamentals of Convolutional Coding. Piscataway, NJ: IEEE Press, 1999.
4. J. B. Anderson and S. M. Hladik, "Tailbiting BCJR decoders," IEEE J. Select. Areas Commun., vol. 16, pp. 297-302, Feb. 1998.
5. B. D. Kudryashov and T. G. Zakharova, "Block codes from convolutional codes," Probl. Pered. Inform., vol. 25, pp. 98-102, Oct.-Dec. 1989.
6. B. J. Frey, R. Kötter, and A. Vardy, "Skewness and pseudocodewords in iterative decoding," in Proc. 1998 IEEE Int. Symp. Information Theory (Cambridge, MA: MIT, Aug. 16-21, 1998), p. 148.
7. G. D. Forney, Jr., F. R. Kschischang, and B. Marcus, "Iterative decoding of tail-biting trellises," in Proc. 1998 IEEE Information Theory Workshop (San Diego, CA, Feb. 9-11, 1998).
8. N. Wiberg, "Codes and decoding on general graphs," Ph.D. dissertation, Dept. Elec. Eng., Univ. Linköping, Sweden, Apr. 1996.
9. N. Wiberg, H.-A. Loeliger, and R. Kötter, "Codes and iterative decoding on general graphs," Euro. Trans. Telecomm., vol. 6, pp. 513-525, 1995.
10. A. E. Brouwer and T. Verhoeff, "An updated table of minimum distance bounds for linear codes," IEEE Trans. Inform. Theory, vol. 39, pp. 662-677, 1993. [Online]. Available WWW: http://www.win.tue.nl/math/dw/voorlincod.html.
11. A. Lafourcade and A. Vardy, "Lower bounds on trellis complexity of block codes," IEEE Trans. Inform. Theory, vol. 41, pp. 1938-1954, 1995.
12. P. Schuurman, "A table of state complexity bounds for binary linear codes," IEEE Trans. Inform. Theory, vol. 42, pp. 2034-2042, 1996.
13. G. D. Forney, Jr., "Coset codes - Part II: Binary lattices and related codes," IEEE Trans. Inform. Theory, vol. 34, pp. 1152-1187, 1988.
14. 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.
15. J. B. Anderson and K. Balachandran, "Decision depths of convolutional codes," IEEE Trans. Inform. Theory, vol. 35, pp. 455-459, Mar. 1989.
16. R. Johannesson and K. Sh. Zigangirov, "Distances and distance bounds for convolutional codes," in Topics in Coding Theory - In honor of Lars H. Zetterberg. Berlin, Germany: Springer-Verlag, 1989, pp. 109-136.