Skip to Main content Skip to Navigation
Journal articles

Bounds on the minimum distance of the duals of BCH codes

Abstract : We consider primitive cyclic codes of length p^m-1 over Fp. The codes of interest here are duals of BCH codes. For these codes, a lower bound on their minimum distance can be 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 shall fill this gap by giving, in the first part of the correspondence, a lower bound for an infinite class of duals of BCH codes. Since this family is a filtration of the duals of BCH codes, the bound obtained for it induces a bound for all duals. In the second part we present a lower bound obtained by implementing an algorithmic method due to Massey and Schaub (1988)-the rank-bounding algorithm. The numerical results are surprisingly higher than all previously known bounds
Complete list of metadata

Cited literature [7 references]  Display  Hide  Download

https://hal.inria.fr/inria-00509478
Contributor : Daniel Augot Connect in order to contact the contributor
Submitted on : Thursday, August 12, 2010 - 4:58:11 PM
Last modification on : Thursday, April 14, 2022 - 1:58:01 PM
Long-term archiving on: : Saturday, November 13, 2010 - 2:41:10 AM

Files

i3e2newmat.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Daniel Augot, Françoise Levy-Dit-Vehel. Bounds on the minimum distance of the duals of BCH codes. IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 1996, 42 (4), pp.1257 - 1260. ⟨10.1109/18.508853⟩. ⟨inria-00509478⟩

Share

Metrics

Record views

174

Files downloads

394