The Structure of Tail-Biting Trellises: Minimality and Basic Principles

IEEE Transactions on Information Theory

Volumn 49, Issue 9, 2003, Pages 2081-2105+2322

  Koetter, Ralf ^a   Vardy, Alexander ^b  

^a University of Illinois at Urbana Champaign   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Block codes; Characteristic matrix; Codes on graphs; Convolutional codes; Linearity; Minimal trellises; Tail biting trellises; Trellis complexity

Indexed keywords

ALGORITHMS; BINARY CODES; BLOCK CODES; CONVOLUTIONAL CODES; MATRIX ALGEBRA;

TAIL-BITING TRELLISES;

TRELLIS CODES;

EID: 0043282872     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2003.815769     Document Type: Article

References (35)

1. S. Aji, G. Horn, R. J. McEliece, and M. Xu, "Iterative min-sum decoding of tail-biting codes," in Proc. IEEE Workshop on Information Theory, Killarney, Ireland, June 1998, pp. 68-69.
2. I. Bocharova, R. Johannesson, B. Kudryashov, and P. Ståhl, "Tailbiting codes: Bounds and search results," IEEE Trans. Inform, Theory, vol. 48, pp. 137-148, Jan. 2002.
3. 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.
4. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups. New York: Springer-Verlag, 1988.
5. G. D. Forney, Jr., "Dimension/length profiles and trellis complexity of lattices," IEEE Trans. Inform. Theory, vol. 40, pp. 1753-1772, Nov. 1994.
6. _, "Codes on graphs: Normal realizations," IEEE Trans. Inform. Theory, vol. 47, pp. 520-548, Feb. 2001.
7. G. D. Forney, Jr., F. R. Kschischang, B. Marcus, and S. Tuncel, "Iterative decoding of tail-biting trellises and connections with symbolic dynamics," in Codes, Systems, and Graphical Models, IMA Volumes in Mathematics and Its Applications, B. Marcus and J. Rosenthal, Eds. New York: Springer-Verlag, Mar. 2001.
8. R. Johannesson, P. Ståhl, and E. Wittenmark, "A note on type II convolutional codes," IEEE Trans. Inform. Theory, vol. 46, pp. 1510-1514, July 2000.
9. N. Karmarkar, "A new polynomial-time algorithm for linear programming," Combinatorica, vol. 4, pp. 373-396, 1984.
10. R. Koetter and A. Vardy, "Construction of minimal tail-biting trellises," in Proc. IEEE Int. Workshop on Information Theory, Killarney, Ireland, June 1998, pp. 72-74.
11. _, "On the theory of linear trellises," in Information, Coding and Mathematics, M. Blaum, P. G. Farrel, and H. C. A. van Tilborg, Eds. Boston, MA: Kluwer, May 2002, pp. 323-354.
12. _, "The structure of tail-biting trellises: Bounds and applications," manuscript in preparation, May 2003.
13. R. Koetter, "On the representation of codes in Forneý graphs," in Codes, Graphs, and Systems, R. E. Blahut and R. Koetter, Eds. Boston, MA: Kluwer, Feb. 2002, pp. 425-450.
14. F. R. Kschischang, "The trellis structure of maximal fixed-cost codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1828-1838, Nov. 1996.
15. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inform. Theory, vol. 47, pp. 498-519, Feb. 2001.
16. F. R. Kschischang and V. Sorokine, "On the trellis structure of block codes," IEEE Trans. Inform. Theory, vol. 41, pp. 1924-1937, Nov. 1995.
17. A. Lafourcade and A. Vardy, "Lower bounds on trellis complexity of block codes," IEEE Trans. Inform. Theory, vol. 41, pp. 1938-1954, Nov. 1995.
18. S. Lin and R. Y. Shao, "General structure and construction of tail-biting trellises for linear block codes," in Proc. IEEE Int. Symp. Information Theory, Sorrento, Italy, June 2000, p. 117.
19. J. H. Ma and J. K. Wolf, "On tail-biting convolutional codes," IEEE Trans. Commun., vol. COM-34, pp. 104-111, Feb. 1986.
20. F. J. Mac Williams and N. J. A. Sloane, The Theory of Error Correcting Codes. New York: North-Holland, 1977.
21. R. J. McEliece, "On the BCJR trellis for linear block codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1072-1092, July 1996.
22. D. J. Muder, "Minimal trellises for block codes," IEEE Trans. Inform. Theory, vol. 34, pp. 1049-1053, Sept. 1988.
23. S. Riedel and C. Weiß, "The Golay convolutional code - Some application aspects," IEEE Trans. Inform. Theory, vol. 45, pp. 2191-2199, Sept. 1999.
24. A. Schrijver, Theory of Linear and Integer Programming. New York: Wiley, 1986.
25. Y. Shany and Y. Be'ery, "Linear tail-biting trellises, the square root bound, and applications for Reed-Muller codes," IEEE Trans. Inform. Theory, vol. 46, pp. 1514-1523, July 2000.
26. R. Y. Shao, S. Lin, and M. P. C. Fossorier, "Decoding of codes based on their tail biting trellises," in Proc. IEEE Int. Symp. Information Theory, Sorrento, Italy, June 2000, p. 342.
27. P. Ståhl, "On tail-biting codes from convolutional codes," Ph.D. dissertation, Tech. Univ. Lund, Lund, Sweden, Dec. 2001.
28. P. Ståhl, J. B. Anderson, and R. Johannesson, "Optimal and near-optimal encoders for short and moderate-length tailbiting trellises," IEEE Trans. Inform. Theory, vol. 45, pp. 2562-2571, Nov. 1999.
29. É. Tardos, "A strongly polynomial algorithm to solve combinatorial linear programs," Oper. Res., vol. 34, pp. 250-256, Apr. 1986.
30. V. Tarokh and A. Vardy, "Upper bounds on trellis complexity of lattices," IEEE Trans. Inform. Theory, vol. 43, pp. 1294-1300, July 1997.
31. A. Vardy, "Trellis structure of codes," in Handbook of Coding Theory, V. S. Pless and W. C. Huffman, Eds. Amsterdam, The Netherlands: Elsevier, 1998, pp. 1989-2118.
32. A. Vardy and Y. Be'ery, "Bit-level soft-decision decoding of Reed-Solomon codes," IEEE Trans. Commun., vol. 39, pp. 440-445, Mar. 1991.
33. A. Vardy and F. R. Kschischang, "Proof of a conjecture of McEliece regarding the expansion index of the minimal trellis," IEEE Trans. Inform. Theory, vol. 42, pp. 2027-2034, Nov. 1996.
34. pm," in Proc. IEEE Int. Symp. Information Theory, Sorrento, Italy, June 2000.
35. N. Wiberg, H.-A. Loeliger, and R. Kötter, "Codes and iterative decoding on general graphs," Euro. Trans. Telecommun., vol. 6, pp. 513-526, May 1995.