Decoding Cyclic and BCH Codes up to Actual Minimum Distance Using Nonrecurrent Syndrome Dependence Relations

IEEE Transactions on Information Theory

Volumn 37, Issue 6, 1991, Pages 1716-1723

  Tzeng, Kenneth K ^a  

^a LEHIGH UNIVERSITY   (United States)

Author keywords

BCH coding; Cyclic coding; decoding up to actual minimum distance; generalization of Peterson decoding procedure

Indexed keywords

EID: 0345024026     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.104340     Document Type: Article

References (19)

1. E. R. Berlekamp, Algebraic Coding Theory. McGraw-Hill, New York, 1968.
2. J. L. Massey, “Shift-register synthesis and BCH decoding,” IEEE Trans. Inform. Theory, vol. IT-15, pp. 122–127, Jan. 1969.
3. Y. Sugiyama, M. Kasahara, S. Hirasawa, and T. Namekawa, “A method for solving key equation for decoding Goppa codes,” Inform. Contr., vol. 27, no. 1, pp. 87–99, Jan. 1975.
4. G. L. Feng and K. K. Tzeng, “A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes,” IEEE Trans. Inform. Theory, vol. 37, pp. 1274–1287, Sept. 1991.
5. G. L. Feng and K. K. Tzeng, “A generalized Euclidean algorithm for multisequence shift-register synthesis,” IEEE Trans. Inform. Theory, vol. 35, pp. 584–594, May 1989.
6. C. R. P. Hartmann and K. K. Tzeng, “Generalizations of the BCH bound,” Inform. Contr., vol. 20, no. 5, pp. 489–498, June 1972.
7. C. Roos, “A new lower bound for the minimum distance of a cyclic code,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 330–332, May 1983.
8. G. L. Feng and K. K. Tzeng, “Decoding cyclic and BCH codes up to the Hartmann-Tzeng and Roos bounds,” presented at the IEEE Int. Symp. Inform. Theory, San Diego, CA, Jan. 14–19, 1990.
9. C. R. P. Hartmann, “Decoding beyond the BCH bound,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 441–444, May 1972.
10. K. K. Tzeng and C. R. P. Hartmann, “Generalized BCH decoding,” presented at the IEEE Int. Symp. Inform. Theory, Ashkelon, Israel, June 1973.
11. C. R. P. Hartmann and K. K. Tzeng, “Decoding beyond the BCH bound using multiple sets of syndrome sequences,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 292–295, Mar. 1974.
12. P. H. Chen, “Multisequence linear shift-register synthesis and its application to BCH decoding,” IEEE Trans. Commun., vol. 24, pp. 438–440, Apr. 1976.
13. P. Stevens, “Extension of the BCH decoding algorithm to decode binary cyclic codes up to their maximum error-correction capacities,” IEEE Trans. Inform. Theory, vol. 34, pp. 1332–1340, Sept. 1988.
14. M. Elia, “Algebraic decoding of the (23,12,7) Golay codes,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 150–151, Jan. 1987.
15. P. Bours, J. C. M. Janssen, M. van Asperdt, and H. C. A. van Tilborg, “Algebraic decoding beyond e BCH of some binary cyclic codes, when e>e BCU,” IEEE Trans. Inform. Theory, vol. 36, pp. 214–222, Jan. 1990.
16. W. W. Peterson and E. J. Weldon, Jr., Error-Correcting Codes, 2nd ed. Cambridge, MA: MIT Press, 1972.
17. J. H. van Lint and R. M. Wilson, “On the minimum distance of cyclic codes,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 23–40, Jan. 1986.
18. D. A. Bader and P. J. Stinson, “Table of lower bounds on the minimum distance of cyclic and BCH codes,” NSF Res. Experiences for Undergraduates (REU) Program Summer Project Rep., Dept, of Comput. Sci. and Elect. Eng., Lehigh Univ., Bethlehem, PA, 1989.
19. R. E. Blahut, Fast Algorithm for Digital Processing. Reading, MA: Addison-Wesley, 1985.