For antiprimitive BCH codes of length q^m+1 and designed distance 3, the minimum distance is 3 iff gcd(2h+1,q+1,q^m+1) is not 1, and for odd q and m it is 4 iff gcd(2h+1,q+1) equals 1.
Explicit evaluations of some Weil sums,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The minimum distance of the antiprimitive BCH code with designed distance 3
For antiprimitive BCH codes of length q^m+1 and designed distance 3, the minimum distance is 3 iff gcd(2h+1,q+1,q^m+1) is not 1, and for odd q and m it is 4 iff gcd(2h+1,q+1) equals 1.