Ward's divisibility conjecture for Griesmer codes

About 1 year old · traced to

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 pe∣dp^e\mid d and pe≥qp^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.

References

Primary source

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

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.