Ward's divisibility conjecture for Griesmer codes

From papers

Let CC be a [gq(k,d),k,d]q[g_q(k,d),k,d]_q Griesmer code, where q=pfq=p^f.

Ward's divisibility conjecture. Suppose that pedp^e\mid d and peqp^e\geq q. Then pe+1/qp^{e+1}/q is a divisor of CC.

This conjecture seeks to extend Ward's divisibility results for Griesmer codes over nonprime fields. It is motivated by the fact that divisibility over prime fields is stronger, while examples such as the hexacode show that qeq^e-divisibility need not hold when q=pfq=p^f with f>1f>1; its resolution is not specified here.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Haihua Deng, Hexiang Huang and Qing Xiang, “Divisibility of Griesmer Codes”, arXiv:2506.07846 (2025).

Solutions 0

No solutions have been posted yet.