Work

A proof of Ward's conjecture on Griesmer codes

Year: 2026
Type: preprint
Abstract: Let $C$ be an $[n,k,d]_q$ Griesmer code, where $q=p^f$ with $p$ prime, and write $e=ν_p(d)$. Ward conjectured that $C$ is $p^{\max\{0,e-f+1\}}$-divisible. In this paper, we prove this conjecture.
Institution: Zhejiang University
Language: English
Open Access status: green
Award: G304922999
OpenAlex ID: W7223237574
Cites: 2
Cited by:
Related to: 10