Entropy/length profiles, bounds on the minimal covering of bipartite graphs, and trellis complexity of nonlinear codes

IEEE Transactions on Information Theory

Volumn 44, Issue 2, 1998, Pages 580-598

  Reuven, Ilan ^b   Be'ery, Yair ^a,b  

^a IEEE

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Bipartite graphs; Complete graphs; Entropy; Entropy length profiles; Mutual information; Nonlinear codes; Trellis complexity

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; INFORMATION THEORY; MATHEMATICAL MODELS; PROBABILITY; TRELLIS CODES;

BIPARTITE GRAPHS; ENTROPY LENGTH PROFILE; LINEAR CODES; NONLINEAR CODES; STATE COMPLEXITY;

BLOCK CODES;

EID: 0032026258     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.661506     Document Type: Article

References (29)

1. L. R. 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. Y. Berger and Y. Be'ery, "The twisted squaring construction, trellis complexity, and generalized weights of BCH and QR codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1817-1827, Nov. 1996.
3. M. R. Best, "Binary codes with a minimum distance of four," IEEE Trans. Inform. Theory, vol. IT-26, pp. 738-742, Nov. 1980.
4. G. D. Forney, Jr., "Coset codes - Part II: Binary lattices and related codes)," IEEE Trans. Inform. Theory, vol. 34, pp. 1152-1187, Sept. 1988.
5. _, "Dimension/length profiles and trellis complexity of linear block codes," IEEE Trans. Inform. Theory, vol. 40, pp. 1741-1752, Nov. 1994.
6. 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, Sept. 1993.
7. R. G. Gallager, Information Theory and Reliable Communication. New-York: Wiley, 1968.
8. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: Freeman, 1979.
9. M. Hall, Jr., Combinatorial Theory. Waltham, MA: Blaisdell, 1967.
10. D. Julin, "Two improved block codes," IEEE Trans. Inform. Theory, vol. IT-11, p. 459, July 1965.
11. T. Kasami, T. Takata, T. Fujiwara, and S. Lin, "On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes," IEEE Trans. Inform. Theory, vol. 39, pp. 242-245, Jan. 1993.
12. _, "On complexity of trellis structure of linear block codes," IEEE Trans. Inform. Theory, vol. 39, pp. 1057-1064, May 1993.
13. A. D. Kot and C. Leung, "On the construction and dimensionality of linear block code trellises," in Proc. 1993 IEEE Int. Symp. on Information Theory (San Antonio, TX, Jan. 17-22, 1993), p. 291.
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 and V. Sorokine, "On the trellis structure of block codes," IEEE Trans. Inform. Theory, vol. 41, pp. 1924-1937, Nov. 1995.
16. A. Lafourcade and A. Vardy, "Lower bounds on trellis complexity of block codes," IEEE Trans. Inform. Theory, vol. 41, pp. 1938-1954, Nov. 1995.
17. C.-C. Lu and S.-H. Huang, "On bit-level trellis of Reed-Muller codes," IEEE Trans. Inform. Theory, vol. 41, pp. 2061-2064, Nov. 1995.
18. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. New York: North-Holland, 1977.
19. J. L. Massey, "Foundation and methods of channel encoding," in Proc. Int. Conf. on Information Theory and Systems, NTG-Fachberichte (Berlin, Germany, Sept. 1978), vol. 65, pp. 148-157.
20. R. J. McEliece, "On the BCJR trellis for linear block codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1072-1092, July 1996.
21. D. J. Muder, "Minimal trellises for block codes," IEEE Trans. Inform. Theory, vol. 34, pp. 1049-1053, Sept. 1988.
22. V. R. Sidorenko, "The Euler characteristic of the minimal code trellis is maximum," Probl. Inform. Transm., vol. 33, no. 1, pp. 12-11, Mar. 1997.
23. V. Sidorenko, I. Martin, and B. Honary, "On separability of nonlinear block codes," preprint.
24. A. Vardy, "The Nordstrom-Robinson code: Representation over GF(4) and efficient decoding," IEEE Trans. Inform. Theory, vol. 40, pp. 1686-1693, Sept. 1994.
25. A. Vardy and Y. Be'ery, "Maximum-likelihood soft decision decoding of BCH codes," IEEE Trans. Inform. Theory, vol. 40, pp. 546-554, Mar. 1994.
26. 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.
27. D. B. West, Introduction to Graph Theory. Englewood Cliffs, NJ: Prentice-Hall, 1996.
28. J. K. Wolf, "Efficient maximum likelihood decoding of linear block codes using a trellis," IEEE Trans. Inform. Theory, vol. IT-24, pp. 76-80, Jan. 1978.
29. V. V. Zyablov and V. R. Sidorenko, "Bounds on complexity of trellis decoding of linear block codes," Probl. Pered. Inform., vol. 29, pp. 3-9, 1993.