Generation of matrices for determining minimum distance and decoding of cyclic codes

IEEE Transactions on Information Theory

Volumn 42, Issue 2, 1996, Pages 653-657

  Shen, K K ^a   Wang, C ^a   Tzeng, K K ^a   Shen, B Z ^a  

^a Lehigh University   (United States)

Author keywords

Cyclic coding; Decoding, minimum distance; Matrices; Newton's identities

Indexed keywords

ALGORITHMS; BINARY CODES; CODING ERRORS; DECODING; ERROR CORRECTION; MATRIX ALGEBRA; POLYNOMIALS;

BCH CODES; CYCLIC CODES; CYCLIC CODING; HARTMANN-TZENG BOUNDS; MINIMUM DISTANCE; NEWTON IDENTITIES; ROOS BOUNDS; SYNDROME MATRICES; VAN LINT SHIFTING TECHNIQUES; WILSON SHIFTING TECHNIQUES;

ENCODING (SYMBOLS);

EID: 0030104964     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.485738     Document Type: Article

References (18)

1. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1978.
2. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
3. G. L. Feng and K. K. Tzeng, "A new procedure for decoding cyclic and BCH codes up to actual minimum distance," IEEE Trans. Inform. Theory, vol. 40, pp. 1364-1374, Sept. 1994.
4. J. L. Massey, "Shift-register synthesis and BCH decoding," IEEE Trans. Inform. Theory, vol. IT15, pp. 122-127, Jan. 1969.
5. G. L. Fcng and K. K. Tzcng, "A generalized Euclidean algorithm for multisequence shift-register synthesis," IEEE Trans. Inform. Theory, vol. 35, pp. 584-594, May 1989.
6. "A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic
7. uodes," IEEE Tran,. Inform. Theary, vol. 37, pp. 1274-1287. Sept. 1991
8. K. K. Tzeng and C. R. P. Hartmann, "On the minimum distance of certain reversible cyclic codes," lEEETrans. Inform. Theory, vol. IT16,
9. pp. 644-646, Sept. 1970.
10. C. R. P. Hartmann and K. K. Tzeng, "Generali/,atinns o!' the BCH bound," Inform. Contr., vol. 20, no. 5, pp. 489-498, June 1972.
11. C. R. P. Hartmann, K. K. Tzeng, and R. T. Chien, "Some results on the minimum distance structure of cyclic codes," IEEE Trans. Inform.
12. Theory, vol. IT18, pp. 402-409, May 1972.
13. R. T. Chien, "A new proof of the BCH bound," IEEE Trans. Inform. Theory, vol. IT18, p. 541, July 1972.
14. D. Augot, P. Charpin, and N. Sendrier, "The minimum distance of some binary codes via Newton's identities," Lecture Notes in Computer Science, vol. 514. Also in Eurocode '90: Int. Symp. on Coding Theory and Applications (Udine, Italy, Nov. 5-9, 1990), pp. 65-73.
15. J. H. van Lint and R. M. Wilson, "On the minimum distance of cyclic codes," IEEE Trans. Inform. Theory, vol. IT32, pp. 23-40, Jan. 1986.
16. B.-Z. Shen and K. K. Tzeng, "Generation of matrices for determining minimum distance and decoding of algebraic-geometric codes," in Proc. 1994 IEEE Int. Workshop on Information Theory (Moscow, Russia, July 3-8, 1994), pp. 89-90. Also, IEEE Trans. Inform. Theory (Special Issue on Algebraic-Geometric Codes), vol. 41, no. 6, pp. 1703-1708, Nov. 1995.
17. S. A. Brown, "Implementing extended Newton's identities to generate decoding syndrome matrices for cyclic codes," NSF Research Experiences for Undergraduates (REU) Program Summer Project Rep., Dept. Elec. Eng. and Comput. Sci., Lehigh Univ., Bethlehem, PA, Aug. 1994.
18. K. K. Shen, C. Wang, K. K. Tzeng, and B.-Z. Shen, "Table of matrices for determining minimum distance and decoding of cyclic codes," Tech. Rep., Dcpt. Elec. Eng. and Comput. Sci., Lehigh Univ., Bethlehem, PA, Sept. 1994.