Bounds on the Trellis Size of Linear Block Codes

IEEE Transactions on Information Theory

Volumn 39, Issue 1, 1993, Pages 203-209

  Berger, Yuval ^a   Be’ery, Yair ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

eontraction index; maximum likelihood deeoding; soft deelsion deeoding; Trellis; zero eoneurring codewords

Indexed keywords

DECODING; STATE SPACE METHODS;

CONTRACTION INDEX; LINEAR BLOCK CODES; MAXIMUM LIKELIHOOD DECODING; MINIMAL TRELLIS; RECURSIVE SQUARING; REED-MULLER CODES; REPEATED-ROOT CYCLIC CODES; SOFT-DECISION DECODING; ZERO-CONCURRING CODEWORDS;

CODES (SYMBOLS);

EID: 0027233245     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.179359     Document Type: Article

References (13)

1. J. K. Wolf, “Efficient maximum likelihood decoding of linear block codes using a trellis,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 76–80, 1978.
2. G. D. Forney, Jr., “Coset codes—Part II: Binary lattices and related codes,” IEEE Trans. Inform. Theory, vol. 34, pp. 1152–1187, Sept. 1988.
3. D.J. Muder, “Minimal trellises for block codes,” IEEE Trans. Inform. Theory, vol. 34, pp. 1049–1053, Sept. 1988.
4. Y. Be’ery and J. Snyders, “Optimal soft decision block decoders based on fast Hadamard transform,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 355–364, May 1986.
5. A. Vardy and Y. Be’ery, “On the problem of finding zero-concurring codewords,” IEEE Trans. Inform. Theory, vol. 37, pp. 180–187, Jan. 1991.
6. J. Snyders and Y. Be’ery, “Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes,” IEEE Trans. Inform. Theory, vol. 35, pp. 963–975, Sept. 1989.
7. A. Vardy, J. Snyders, and Y. Be’ery, “Bounds on the dimension of codes and subcodes with prescribed contraction index,” Linear Algebra Appl., vol. 142, pp. 237–261, 1990.
8. J.H. van Lint, “Repeated-root cyclic codes,” IEEE Trans. Inform. Theory, vol. 37, pp. 343–345, Mar. 1991.
9. G. Castagnoli, J.L. Massey, Ph. Schoeller, and N. von Seemann, “On repeated-root cyclic codes,” IEEE Trans. Inform. Theory, vol. 37, pp. 337–342, Mar. 1991.
10. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North Holland, 1977.
11. A. Vardy and Y. Be’ery, “Bit-level soft-decision decoding of Reed-Solomon codes,” IEEE Trans. Commun., vol. 39, pp. 440-445, 1991.
12. R.L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics. Reading, MA: Addison-Wesley, 1989.
13. H.J. Helgert and R.D. Stinaff, “Shortened BCH codes,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 818–820, 1973.