A table of state complexity bounds for binary linear codes

IEEE Transactions on Information Theory

Volumn 42, Issue 6 PART 1, 1996, Pages 2034-2042

  Schuurman, Petra ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Binary linear codes; State complexity

Indexed keywords

ALGORITHMS; CODING ERRORS; COMPUTATIONAL COMPLEXITY; DECODING; INFORMATION THEORY; MATRIX ALGEBRA; OPTIMIZATION; TRELLIS CODES;

BINARY LINEAR CODES; STATE COMPLEXITY BOUNDS;

BINARY CODES;

EID: 0030284119     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.556700     Document Type: Article

References (19)

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, 1974.
2. A. E. Brouwer and T. Verhoeff, An updated table of minimum-distance bounds for binary linear codes, IEEE Trans. Inform. Theory, vol. 39, pp. 662-677, 1993.
3. S. B. Encheva, Optimal binary linear codes, Ph.D. dissertation, University of Bergen, Bergen, Sweden, Sept. 1994.
4. G. D. Forney, Jr., Coset codes-Part II: Binary lattices and related codes, IEEE Trans. Inform. Theory, vol. 34, pp. 1152-1187, 1988.
5. Dimension/length profiles and trellis complexity of linear block codes, IEEE Trans. Inform. Theory, vol. 40, pp. 1741-1752, 1994.
6. A. Lafourcade and A. Vardy, Asymptotically good codes have infinite trellis complexity, IEEE Trans. Inform. Theory, vol. 41, pp. 555-559, 1995.
7. -,Lower bounds on trellis complexity of block codes, IEEE Trans. Inform. Theory, vol. 41, pp. 1938-1954, 1995.
8. V. N. Logacev, An improvement of the Griesmer bound in the case of small code distances, Optimiz. Methods and their AppL, vol. 182, pp. 107-111, 1972.
9. F. J. Mac Williams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North Holland, 1977.
10. R. J. McEliece, On the BCJR trellis for linear block codes, preprint, Sept. 1994.
11. D. J. Muder, Minimal trellises for block codes, IEEE Trans. Inform. Theory, vol. 34, pp. 1049-1053, 1988.
12. P. Schuurman, Bounds on the state complexity of binary linear block codes, Master's thesis, Eindhoven University of Technology, Eindhoven, The Netherlands, Dec. 1995.
13. H. C. A. van Tilborg, On the uniqueness resp. nonexistence of certain codes meeting the Griesmer bound, Inform. Contr., vol. 44, pp. 16-35, 1980.
14. A. Vardy and Y. Be'ery, Maximum-likelihood soft decision decoding of BCH codes, lEEETrans. Inform. Theory, vol. 40, pp. 546-554, 1994.
15. Y.-Y. Wang and C.-C. Lu, The trellis complexity of equivalent binary [17, 9] quadratic residue codes is five, in Proc. Int. Symp. on Information Theory, 1993, p. 200,
16. V. K. Wei, Generalized Hamming weights for linear codes, IEEE Trans. Inform. Theory, vol. 37, pp. 1412-1418, 1991.
17. J. K. Wolf, Efficient maximum-likelihood decoding of linear block codes, IEEE Trans. Inform. Theory, vol. IT-24, pp. 76-80, 1978.
18. 0. Ytrehus, On the trellis complexity of some classes of linear block codes, IEEE Trans. Inform. Theory, vol. 41, pp. 559-560, 1995.
19. V. V. Zyablov and V. R. Sidorenko, Bounds on the complexity of trellis decoding of linear block codes, Probl. Pered. Inform., vol. 29, pp. 3-9, 1993 (in Russian).