Conjecture on Z_{p^s}-linear generalized Hadamard codes
For every prime , codes in the family with and are not equivalent to any distinct code in the same family having the same length ; equivalently, if and have length , , , and distinct parameter data, then .
References
- Full classification of Z_{p^s}-linear generalized Hadamard codes — arXiv — Dipak K. Bhunia
Source: arXiv
Progress summary
An unrefereed preprint claims to prove the conjecture in the stated case, but no independent verification has been reported.
The conjecture concerns whether certain -linear generalized Hadamard codes with and can be equivalent to other codes of the same length. Earlier work left this unresolved outside finite parameter ranges.
Known results
- For , the conjectured inequivalence was known through ; for , through ; and for , through .
- Exact numbers of inequivalent codes were established in corresponding finite ranges, including for , for , and for .
- For prime , classification was complete only through , 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 and . 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 and , but the result is unverified; earlier finite-range classifications remain established.
Solutions 0
No solutions have been posted yet.