Minimal tail-biting trellises: the Golay code and more

IEEE Transactions on Information Theory

Volumn 45, Issue 5, 1999, Pages 1435-1455

  Calderbank, A R ^a,b   Forney Jr , G David ^a,c   Vardy, Alexander ^a,d  

^a IEEE   (United States)

^b AT AND T LABS RESEARCH   (United States)

^c MOTOROLA INC   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GOLAY CODE; HEXACODE; ITERATIVE DECODING; TAIL BITING TRELLIS;

BINARY CODES; COMPUTATIONAL COMPLEXITY; CONVOLUTIONAL CODES; DECODING; MATRIX ALGEBRA; TRELLIS CODES;

BLOCK CODES;

EID: 0032675409     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.771145     Document Type: Article

References (70)

1. K. Abdel-Ghaffar, R. J. McEliece, and G. Solomon, "Some partial-unit-memory convolutional codes," Jet Propulsion Lab. TDA Progr. Rep., vol. 42-107, pp. 57-72, Nov. 1991.
2. S. M. Aji and R. J. McEliece, "The generalized distributive law," IEEE Trans. Inform. Theory, submitted for publication, July 1998.
3. O. Amrani, Y. Be'ery, A. Vardy, F.-W. Sun, and H. C. A. van Tilborg, "The Leech lattice and the Golay code: Bounded-distance decoding and multilevel constructions," IEEE Trans. Inform. Theory, vol. 40, pp. 1030-1043, July 1994.
4. J. B. Anderson and S. M. Hladik, "Tail-biting MAP decoders," IEEE J. Select. Areas Commun., vol. 16, pp. 297-302, Feb. 1998.
5. E. F. Assmus, H. F. Mattson, Jr., and R. J. Turyn, "Research to develop the algebraic theory of codes," Rep. AFCRL-67-0365, Air Force Res. Labs., Bedford, MA, June 1967.
6. I. E. Bocharova and B. D. Kudryashov, "Rational rate punctured convolutional codes for soft-decision Viterbi decoding," IEEE Trans. Inform. Theory, vol. 43, pp. 1305-1313, July 1997.
7. _, private communication, Sept. 1997.
8. R. W. D. Booth, M. A. Herro, and G. Solomon, "Convolutional coding techniques for certain quadratic residue codes," in Proc. Int. Telemetry Conf. (Silver Springs, MD, 1975).
9. A. R. Calderbank, G. D. Forney, Jr., and A. Vardy, "Classification of certain tail-biting generators for the binary Golay code," in Codes, Curves, and Signals: Common Threads in Communications, A. Vardy, Ed. Boston, MA: Kluwer, 1998, pp. 127-153.
10. J. H. Conway, V. S. Pless, and N. J. A. Sloane, "The binary self-dual codes of length up to 32: A revised enumeration," J. Comb. Theory Ser. A, vol. 60, pp. 183-195, Jan. 1992.
11. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups, 2nd ed. New York: Springer-Verlag, 1993.
12. M. Cedervall and R. Johannesson, "A fast algorithm for computing the distance spectrum of convolutional codes," IEEE Trans. Inform. Theory, vol. 35, pp. 1146-1159, Nov. 1989.
13. E. Gelblum, private communication, Aug. 1997.
14. J. Feigenbaum, G. D. Forney, Jr., B. H. Marcus, R. J. McEliece, and A. Vardy, Eds., IEEE Trans. Inform. Theory (Special Issue on "Codes and Complexity"), vol. 42, Nov. 1996.
15. G. D. Forney, Jr., "Structural analysis of convolutional codes via dual cotes," IEEE Trans. Inform. Theory, vol. IT-19, pp. 512-518, July 1973.
16. _, "Coset codes-Part I: Introduction and geometrical classification," IEEE Trans. Inform. Theory, vol. 34, pp. 1123-1151, Sept. 1988.
17. _, "Coset codes-Part II: Binary lattices and related codes," IEEE Trans. Inform. Theory, vol. 34, pp. 1152-1187, Sept. 1988.
18. _, "Dimension/length profiles and trellis complexity of linear block cotes," IEEE Trans. Inform. Theory, vol. 40, pp. 1741-1752, Nov. 1994.
19. _, "Density-length profiles and trellis complexity of lattices," IEEE Trans. Inform. Theory, vol. 40, pp. 1753-1772, Nov. 1994.
20. _, "The forward-backward algorithm," in Proc. 34th Annu. Allerton Conf. Communication, Control, and Computing (Monticello, IL, Oct. 1996), pp. 432-446.
21. G. D. Forney, Jr., N. J. A. Sloane, and M. D. Trott, "The Nordstrom-Robinson code is the binary image of the octacode," in Proc. Coding and Quantization (DIMACS/IEEE Workshop, October 19-21, 1992), A. R. Calderbank et al., Eds. Providence, RI: Amer. Math. Soc., 1993, pp. 19-26.
22. G. D. Forney, Jr. and M. D. Trott, "The dynamics of group codes: State spaces, trellis diagrams and canonical encoders," IEEE Trans. Inform. Theory, vol. 39, pp. 1491-1513, 1993.
23. B. J. Frey, "Bayesian networks for pattern classification, data compression, and channel coding," Ph.D. dissertation, Univ. Toronto, Toronto, Ont., Canada, July 1997.
24. 4-linearity of Kerdock, Preparata, Goethals, and related codes," IEEE Trans. Inform. Theory, vol. 40, pp. 301-319, Mar. 1994.
25. M. F. Hole and Ø. Ytrehus, "Two-step decoding of partial unit memory convolutional codes," IEEE Trans. Inform. Theory, vol. 43, pp. 324-330, Jan. 1997.
26. R. Johannesson, P. Stahl, and E. Wittenmark, private communication, Dec. 1997.
27. R. Johannesson and K. S. Zigangirov, Fundamentals of Convolutional Codes. Piscataway, NJ: IEEE Press, 1998.
28. J. Justesen, "Bounded distance decoding of unit memory codes," IEEE Trans. Inform. Theory, vol. 39, pp. 1616-1627, Sept. 1993.
29. A. B. Kiely, S. Dolinar, R. J. McEliece, L. Ekroot, and W. Lin, "Trellis decoding complexity of linear block codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1687-1697, Nov. 1996.
30. R. Kötter and A. Vardy, "Construction of minimal tail-biting trellises," in Proc. IEEE Inform. Theory Workshop (Killarney, Ireland, June 1998), pp. 72-74.
31. _, "The theory of tail-biting trellises: minimality and basic principles," preprint, May 1999.
32. _, "The theory of tail-biting trellises: bounds and applications," manuscript in preparation, May 1999.
33. _, private communication, Dec. 1997.
34. F. R. Kschischang and V. Sorokine, "On the trellis structure of block codes," IEEE Trans. Inform. Theory, vol. 41, pp. 1924-1937, Nov. 1995.
35. F. R. Kschischang and B. J. Frey, "Iterative decoding of compound codes by probability propagation in graphical models," IEEE J. Select. Areas Commun., vol. 16, pp. 219-230, 1998.
36. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inform. Theory, submitted for publication, July 1998.
37. B. D. Kudryashov and T. G. Zakharova, "Block codes from convolutional codes," Probl. Pered. Inform., vol. 25, no. 4, pp. 98-102, Jan. 1989.
38. A. Lafourcade and A. Vardy, "Asymptotically good codes have infinite trellis complexity," IEEE Trans. Inform. Theory, vol. 41, pp. 555-559, Mar. 1995.
39. _, "Lower bounds on trellis complexity of block codes," IEEE Trans. Inform. Theory, vol. 41, pp. 1938-1954, Nov. 1995.
40. G. S. Lauer, "Some optimal partial-unit-memory codes," IEEE Trans. Inform. Theory, vol. IT-25, pp. 240-243, Mar. 1979.
41. L.-N. Lee, "Short unit-memory byte-oriented binary convolutional codes having maximal free distance," IEEE Trans. Inform. Theory, vol. IT-22, pp. 349-352, May 1976.
42. P. J. Lee, "There are many good periodically-time-varying convolutional codes," IEEE Trans. Inform. Theory, vol. 35, pp. 460-463, Mar. 1989.
43. W. Lin and R. J. McEliece, "Hybrid trellis decoding for some convolutional codes," in Proc. Conf. Information Sciences and Systems (Princeton, NJ, Mar. 1996), pp. 572-577.
44. J. H. Ma and J. K. Wolf, "On tail-biting convolutional codes," IEEE Trans. Commun., vol. COM-34, pp. 104-111, Feb. 1986.
45. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error Correcting Codes. New York: North-Holland, 1977.
46. R. J. McEliece, "On the BCJR trellis for linear block codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1072-1092, July 1996.
47. _, private communication, Jan. 1998.
48. R. J. McEliece and W. Lin, "The trellis complexity of convolutional codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1855-1864, Nov. 1996.
49. R. J. McEliece, D. J. C. MacKay, and J.-F. Cheng, "Turbo decoding as an instance of Pearl's belief propagation algorithm," IEEE J. Select. Areas Commun., vol. 16, pp. 140-152, 1998.
50. D. J. Muder, "Minimal trellises for block codes," IEEE Trans. Inform. Theory, vol. 34, pp. 1049-1053, Sept. 1988.
51. V. S. Pless, "On the uniqueness of the Golay codes," J. Combin. Theory, vol. 5, pp. 215-228, July 1968.
52. E. M. Rains and N. J. A. Sloane, "Self-dual codes," in Handbook of Coding Theory, V.S. Pless and W. C. Huffman, Eds. Amsterdam, The Netherlands: Elsevier, Dec. 1998.
53. M. Ran and J. Snyders, "A cyclic [6, 3, 4] group code and the hexacode over GF(4)," IEEE Trans. Inform. Theory, vol. 42, pp. 1250-1253, July 1996.
54. A. Reznik, "Iterative decoding of codes defined on graphs," M.Sc. thesis, MIT, Cambridge, MA, May 1998.
55. S. Riedel and C. Weiss, "The Golay convolutional code and its application," IEEE Trans. Inform. Theory, submitted for publication, Jan. 1998.
56. N. J. A. Sloane, private communication, Aug. 1997.
57. G. Solomon and H. C. A. van Tilborg, "A connection between block and convolutional codes," SIAM J. Appl. Math., vol. 37, pp. 358-369, Oct. 1979.
58. M. D. Trott, private communication, Jan. 1998.
59. A. Vardy, "The Nordstrom-Robinson code: Representation over GF(4) and efficient decoding," IEEE Trans. Inform. Theory, vol. 40, pp. 1686-1693, Sept. 1994.
60. _, "Even more efficient bounded-distance decoding of the hexacode, the Golay code, and the Leech lattice," IEEE Trans. Inform. Theory, vol. 41, pp. 1495-1499, 1995.
61. _, "Trellis structure of codes," in Handbook of Coding Theory, V. S. Pless and W. C. Huffman, Eds. Amsterdam, The Netherlands: Elsevier, Dec. 1998.
62. A. Vardy and Y. Be'ery, "More efficient soft-decision decoding of the Golay codes," IEEE Trans. Inform. Theory, vol. 37, pp. 667-672, May 1991.
63. _, "Maximum-likelihood decoding of the Leech lattice," IEEE Trans. Inform. Theory, vol. 39, pp. 1435-1444, July 1993.
64. 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.
65. Q. Wang and V. K. Bhargava, "An efficient maximum-likelihood decoding algorithm for generalized tail-biting codes including quasi-cyclic codes," IEEE Trans. Commun., vol. 37, pp. 875-879, Aug. 1989.
66. Y. Weiss, "Correctness of local probability propagation in graphical models with loops," Neural Comput., submitted for publication, July 1998.
67. N. Wiberg, "Codes and decoding on general graphs," Ph.D. dissertation, Univ. Linköping, Linköping, Sweden, Apr. 1996.
68. N. Wiberg, H.-A. Loeliger and R. Kötter, "Codes and iterative decoding on general graphs," Euro. Trans. Telecommun., vol. 6, pp. 513-526, Sept. 1995.
69. M. Xu and R. J. McEliece, private communication, Sept. 1998.
70. K. S. Zigangirov and V. V. Chepyzhov, "Study of decoding tail-biting convolutional codes," in Proc. Swedish-Soviet Workshop Information Theory (Gotland, Sweden, Aug. 1989), pp. 52-55.