The twisted squaring construction, trellis complexity, and generalized weights of BCH and QR codes

IEEE Transactions on Information Theory

Volumn 42, Issue 6 PART 1, 1996, Pages 1817-1827

  Berger, Yuval ^a   Be'ery, Yair ^b  

^a IEEE

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Bch codes; Block codes; Generalized hamming weights; Quadratic residue codes; Soft decision decoding; Trellises

Indexed keywords

BLOCK CODES; COMPUTATIONAL COMPLEXITY; DECODING; RECURSIVE FUNCTIONS; STATE SPACE METHODS; TRELLIS CODES;

GENERALIZED HAMMING WEIGHTS; QUADRATIC RESIDUE CODES; TRELLIS COMPLEXITY; TWISTED SQUARING CONSTRUCTION CODES;

BINARY CODES;

EID: 0030283870     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.556677     Document Type: Article

References (21)

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. Foraey, Jr., Cosets codes-Part II: Binary lattices and related codes, IEEE Trans. Inform. Theory, vol. 34, pp. 1152-1187, 1988.
3. Y. Berger and Y. Be'ery, Soft trellis-based decoder for linear block codes, IEEE Trans. Inform. Theory, vol. 40, pp. 764-773, 1994.
4. R. J. McEliece and W. Lin, The trellis complexity of convolutional codes, in Proc. 1995 IEEE Int. Symp. on Information Theory (Whistler, BC, Canada, Sept. 1995), p. 131.
5. D. J. Muder, Minimal trellises for block codes, IEEE Trans. Inform. Theory, vol. 34, pp. 1049-1053, 1988.
6. T. Kasami, T. Takata, T. Fujiwara, and S. Lin, On the state complexity of trellis diagrams for Reed-Muller codes and their supercodes, in Proc. 14th Symp. on Information Theory and Its Applications (Ibusuki, Japan, Dec. 1991), pp. 101-104.
7. Y. Berger and Y. Be'ery, Bounds on the trellis size of linear block codes, IEEE Trans. Inform. Theory, vol. 39, pp. 203-209, 1993.
8. T. Kasami, T. Takata, T. Fujiwara, and S. Lin, On complexity of trellis structure of linear block codes, IEEE Trans. Inform. Theory, vol. 39, pp. 1057-1064, 1993.
9. A. Vardy and Y. Be'ery, Maximum-likelihood soft-decision decoding of BCH codes, IEEE Trans. Inform. Theory, vol. 40, pp. 546-554, 1994.
10. Y. Berger and Y. Be'ery, Trellis-oriented decomposition and trellis complexity of composite-length cyclic codes, IEEE Trans. Inform. Theory, vol. 41, pp. 1185-1191, 1995.
11. On the twisted squaring construction, symmetric-reversible designs and trellis diagrams of block codes, in Proc. 1995 IEEE Int. Symp. on Information Theory (Whistler, BC, Canada, Sept. 1995), p. 129.
12. A. Lafourcade and A. Vardy, Asymptotically good codes have infinite trellis complexity, IEEE Trans. Inform. Theory, vol. 41, pp. 555-559, 1995.
13. G. D. Forney, Jr., Dimension/length profiles and trellis complexity of linear block codes, IEEE Trans. Inform. Theory, vol. 40, pp. 1741-1752, 1994.
14. 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.
15. V. K. Wei, Generalized Hamming weights for linear block codes, IEEE Trans. Inform. Theory, vol. 37, pp. 1412-1418, 1991.
16. F. J. McWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North Holland, 1977.
17. A. E. Brouwer and T. Verhoelf, An updated table of minimum-distance bounds for binary linear codes, IEEE Trans. Inform. Theory, vol. 39, pp. 662-677, 1993.
18. G. L. Feng, K. K. Tzeng, and V. K. Wei, On the generalized Hamming weights of several classes of cyclic codes, IEEE Trans. Inform. Theory, vol. 38, pp. 1125-1130, 1992.
19. G. van der Geer and M. van der Vlugt, On generalized Hamming weights of BCH codes, IEEE Trans. Inform. Theory, vol. 40, pp. 543546, 1994.
20. M. van der Vlugt, A notî on generalized Hamming weights of BCH(2), IEEE Trans. Inform. Theory, vol. 42, pp. 253-255, 1996.
21. S. Dolinar, L. Ekroot, A. Kiely, W. Lin, and R. J. McEliece, The permutation trellis complexity of linear block codes, in Proc. 32nd Annu. Allerton Conf. on Communication, Control and Computing (Allerton, IL, Oct. 1994), pp. 60-74.