Idempotents and the BCH bound
- 1 January 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 40 (1) , 204-207
- https://doi.org/10.1109/18.272483
Abstract
International audienceUsing 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 tableKeywords
This publication has 2 references indexed in Scilit:
- Studying the locator polynomials of minimum weight codewords of BCH codesIEEE Transactions on Information Theory, 1992
- On the minimum distance of cyclic codesIEEE Transactions on Information Theory, 1986