← All problems

Conjecture on Z_{p^s}-linear generalized Hadamard codes

For every prime pp, codes in the family Hpt1,…,tsH_p^{t_1,\ldots,t_s} with t1≥2t_1\ge 2 and ts=0t_s=0 are not equivalent to any distinct code in the same family having the same length ptp^t; equivalently, if Hpt1,…,tsH_p^{t_1,\ldots,t_s} and Hpu1,…,urH_p^{u_1,\ldots,u_r} have length ptp^t, t1≥2t_1\ge 2, ts=0t_s=0, and distinct parameter data, then Hpt1,…,ts≁Hpu1,…,urH_p^{t_1,\ldots,t_s}\not\sim H_p^{u_1,\ldots,u_r}.

References

Progress summary

Refreshed
Open · solution reported

An unrefereed preprint claims to prove the conjecture in the stated case, but no independent verification has been reported.

The conjecture concerns whether certain Zps\mathbb{Z}_{p^s}-linear generalized Hadamard codes with t1≥2t_1\geq 2 and ts=0t_s=0 can be equivalent to other codes of the same length. Earlier work left this unresolved outside finite parameter ranges.

Known results

  • For p=2p=2, the conjectured inequivalence was known through t≤11t\leq 11; for p=3p=3, through t≤10t\leq 10; and for p=5p=5, through t≤8t\leq 8.
  • Exact numbers of inequivalent codes were established in corresponding finite ranges, including 5≤t≤115\leq t\leq 11 for p=2p=2, 4≤t≤104\leq t\leq 10 for p=3p=3, and 4≤t≤84\leq t\leq 8 for p=5p=5.
  • For prime p≥3p\geq 3, classification was complete only through t=10t=10, with the general upper bound beyond those ranges remaining conjectural.

October 2026 claimed classification

An October 13, 2026 report describes Dipak K. Bhunia’s preprint, which uses a derived-code argument to claim a complete classification and a proof of the conjecture for t1≥2t_1\geq 2 and ts=0t_s=0. The claim is unrefereed, and the retrieved sources provide no independent mathematical assessment.

Current status (as of October 2026): The conjecture is claimed solved for t1≥2t_1\geq 2 and ts=0t_s=0, but the result is unverified; earlier finite-range classifications remain established.

Sources

Solutions 0

No solutions have been posted yet.