PreprintarXiv licencearXiv
A proof of Ward's conjecture on Griesmer codes
Abstract
Let C be an [n,k,d]q Griesmer code, where q=pf with p prime, and write e=νp(d). Ward conjectured that C is pmax{0,e−f+1}-divisible. In this paper, we prove this conjecture.
Related
- A Hyperplane Bound and Ward's Divisibility Conjecture
- A proof of the Braun-Etzion-Vardy bound for binary subspace codes
- A machine-checked proof of the Dong-Yang classification of optimal (n,4) binary codes for BSCs
- A proof of the Stanley-Stembridge conjecture
- A streamlined proof of the Kakeya set conjecture in R3
BibTeX
@misc{deng2026proof,
title = {{A proof of Ward's conjecture on Griesmer codes}},
author = {Haihua Deng and Weiye Zhang},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.29275},
eprint = {2610.29275},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.29275},
}
RIS
TY - UNPB
TI - A proof of Ward's conjecture on Griesmer codes
AU - Haihua Deng
AU - Weiye Zhang
PY - 2026
DA - 2026/10/21
PB - arXiv
DO - 10.48550/arxiv.2610.29275
UR - https://arxiv.org/abs/2610.29275
AB - 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.
ER -