A proof of Ward's conjecture on Griesmer codes

Haihua Deng, Weiye Zhang

Source record

Source: arXiv

Published: Oct 21, 2026

arXiv: 2610.29275

Open original source ↗

Source 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.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

A proof of Ward's conjecture on Griesmer codes — Mathematical Frontier Network