If q^e divides the minimum distance of a Griesmer code over F_q, all codeword weights are divisible by p^e; a separate geometric argument gives a weaker but new divisibility bound when only p^e divides the minimum distance.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Divisibility of Griesmer Codes
If q^e divides the minimum distance of a Griesmer code over F_q, all codeword weights are divisible by p^e; a separate geometric argument gives a weaker but new divisibility bound when only p^e divides the minimum distance.