Bounds on the minimum distance of the duals of BCH codes

IEEE Transactions on Information Theory

Volumn 42, Issue 4, 1996, Pages 1257-1260

  Augot, Daniel ^a   Levy dit Vehel, Françoise ^a  

^a INRIA   (France)

Author keywords

BCH codes; Duals; Rank bounding algorithm; Roos and weil bounds

Indexed keywords

ALGORITHMS; INFORMATION THEORY; OPTIMIZATION; POLYNOMIALS; THEOREM PROVING;

BCH CODES; CODE DUALS; CYCLE CODES; LOWER BOUND; MINIMUM DISTANCE; WEIL BOUND;

CODES (SYMBOLS);

EID: 0030190764     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.508853     Document Type: Article

References (10)

1. D. Augot, "Etude algébrique des mots de poids minimum des codes cycliques, méthodes d'algèbre linéaire sur les corps finis," Thèse de doctorat, Paris VI (Ph.D. dissertation, University of Paris VI), 1993.
2. C. R. P. Hartmann and K. K. Tzeng, "Generalizations of the BCH bound," Inform. Contr., vol. 20, pp. 489-498, 1972.
3. F. Levy-dit-Vehel, "Bounds on the minimum distance of the duals of extended BCH cedes," Applicable Algebra in Engineering Communication and Computing (AAECC). New York: Springer-Verlag, 1995, vol. 6, no. 3, pp. 175-190.
4. _, "Divibilité des codes cycliques: Applications et prolongements," Thèse de doctorat, Paris VI (Ph.D. dissertation, University of Paris VI), 1994.
5. J. L. Massey and T. Schaub, "Linear complexity in coding theory," in Coding Theory and Applications (Lecture Notes in Computer Science, vol. 311). New York: Springer-Verlag, 1988.
6. O. Moreno and V. Kumar, "Minimum distance bounds for cyclic codes and Deligne's theorem," IEEE Trans. Inform. Theory, vol. 39, no. 5, pp. 1524-1534, Sept. 1993.
7. O. Moreno, V. Zinoviev, and V. Kumar, "The exact minimum distance of some cyclic codes," in Proc. AGCT4'94 (Novgorod, Russia).
8. T. Schaub, "A linear complexity approach to cyclic codes," dissertation, Swiss Federal Institute of Technology, Zuerich, 1988.
9. C. Roos, "A new lower bound for the minimum distance of a cyclic code," IEEE Trans. Inform. Theory, vol. IT-29, no. 3, May 1983.
10. J. Wolfmann, "New bounds on cyclic codes from algebraic curves," in Lecture Notes in Computer Science, vol. 388. New York: Springer-Verlag, 1989, pp. 47-62.