Title :
Bounds on the minimum distance of the duals of BCH codes
Author :
Augot, Daniel ; Levy-dit-Vehel, Françoise
Author_Institution :
Inst. Nat. de Recherche en Inf. et Autom., Le Chesnay, France
fDate :
27 Jun-1 Jul 1994
Abstract :
We consider duals of BCH codes of length pm-1 over GF(p). A lower bound on their minimum distance is found via the adaptation of the Weil bound to cyclic codes. However, this bound is of no significance for roughly half of these codes. We partially fill this gap by giving a lower bound for an infinite class of duals of BCH codes. We also present a lower bound obtained with an algorithm due to Massey and Schaub (1988). In the case of binary codes of length 127 and 255, the results are surprisingly higher than all previously known bounds
Keywords :
BCH codes; Galois fields; binary sequences; cyclic codes; dual codes; BCH codes; Galois field; Weil bound; algorithm; binary codes; code length; cyclic codes; dual codes; lower bound; minimum distance bounds; Artificial intelligence; Binary codes; Computer science; Polynomials;
Conference_Titel :
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location :
Trondheim
Print_ISBN :
0-7803-2015-8
DOI :
10.1109/ISIT.1994.394928
