Bounds on the minimum distance of the duals of BCH codes
Augot, Daniel ; Levy-Dit-Vehel, Françoise
HAL, inria-00509482 / Harvested from HAL
Text on HAL
We consider duals of BCH codes of length p^m-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
Publié le : 1994-06-27
Classification:  ACM: E.: Data/E.4: CODING AND INFORMATION THEORY,  [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT],  [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT] 
@article{inria-00509482,
     author = {Augot, Daniel and Levy-Dit-Vehel, Fran\c coise},
     title = {Bounds on the minimum distance of the duals of BCH codes},
     journal = {HAL},
     volume = {1994},
     number = {0},
     year = {1994},
     language = {en},
     url = {http://dml.mathdoc.fr/item/inria-00509482}
}

Augot, Daniel; Levy-Dit-Vehel, Françoise. Bounds on the minimum distance of the duals of BCH codes. HAL, Tome 1994 (1994) no. 0, . http://gdmltest.u-ga.fr/item/inria-00509482/