1 citations · 1 across the 5 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.IT2026
Minimum distances of primitive narrow-sense BCH codes via good zero-sets
Run Zheng
Determining the exact minimum distances of BCH codes remains a open problem. We establish the minimum distances of several families of primitive narrow-sense BCH codes, showing tha…
cs.IT2026
Counterexamples to Charpin's Conjecture on BCH codes
Run Zheng, Yaoran Yang, Yutong Zhang +2
We construct an infinite family of -ary primitive narrow-sense BCH codes whose minimum distance strictly exceeds the Bose distance; in fact, the gap between the two can be arbit…