A proof of Ward's conjecture on Griesmer codes

2026-10-22来源 arXiv math.ITEnglish
arXiv:2610.29275v1 Announce Type: cross Abstract: Let $C$ be an $[n,k,d]_q$ Griesmer code, where $q=p^f$ with $p$ prime, and write $e=\nu_p(d)$. Ward conjectured that $C$ is $p^{\max\{0,e-f+1\}}$-divisible. In this paper, we prove this conjecture.

原文：https://www.a8q9.cn/en/article/a-proof-of-ward-s-conjecture-on-griesmer-codes-001b19.html

相关文章