The paper proves that multiple infinite families of primitive and non-primitive BCH codes have minimum distance exactly equal to their designed distance δ.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the Minimum Distances of Some Families of BCH Codes
The paper proves that multiple infinite families of primitive and non-primitive BCH codes have minimum distance exactly equal to their designed distance δ.