Binary BCH codes are shown whose minimum distance exceeds the Bose distance by 2^{floor((m-1)/3)-1}, a gap of order n^{1/3}, refuting Charpin's bounded-gap conjecture.
Zeroes of polynomials over finite fields,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.IT 1years
2026 1verdicts
ACCEPT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Counterexamples to Charpin's Conjecture on BCH codes
Binary BCH codes are shown whose minimum distance exceeds the Bose distance by 2^{floor((m-1)/3)-1}, a gap of order n^{1/3}, refuting Charpin's bounded-gap conjecture.