Idempotents and the BCH bound
Augot, Daniel ; Sendrier, Nicolas
HAL, hal-00723735 / Harvested from HAL
Text on HAL
Using a characterization of the idempotents of a narrow- sense primitive binary BCH code, we are able to give classes of such codes whose minimum distance does not exceed the BCH bound. Our results are compiled in a table.
Publié le : 1994-01-01
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{hal-00723735,
     author = {Augot, Daniel and Sendrier, Nicolas},
     title = {Idempotents and the BCH bound},
     journal = {HAL},
     volume = {1994},
     number = {0},
     year = {1994},
     language = {en},
     url = {http://dml.mathdoc.fr/item/hal-00723735}
}

Augot, Daniel; Sendrier, Nicolas. Idempotents and the BCH bound. HAL, Tome 1994 (1994) no. 0, . http://gdmltest.u-ga.fr/item/hal-00723735/