← All problems

Open problem on the Witt design posed by Wang, Tang, and Ding

Let C\mathcal{C} be the cyclic code proposed by Wang, Tang, and Ding, and let Dmin⁡(C⊥)\mathcal{D}_{\min}(\mathcal{C}^{\bot}) denote the design whose blocks are the supports of the minimum-weight codewords of C⊥\mathcal{C}^{\bot}. Let W\mathcal{W} be the Witt spherical geometry design, the 33-(22,6,1)(22,6,1) design. Determine whether Dmin⁡(C⊥)\mathcal{D}_{\min}(\mathcal{C}^{\bot}) is isomorphic to the complementary design W∁\mathcal{W}^{\complement}, equivalently, to the 33-(22,16,4)(22,16,4) design obtained by taking complements of the blocks of W\mathcal{W}; that is, whether there exists a permutation π\pi of the 2222 points such that π(Dmin⁡(C⊥))=W∁\pi(\mathcal{D}_{\min}(\mathcal{C}^{\bot}))=\mathcal{W}^{\complement}.

References

Source: arXiv

Progress summary

Refreshed
Open · solution reported

An October 2026 preprint claims to solve the specifically posed problem by proving the requested isomorphism and deriving associated code data, but the result is unrefereed.

The 2023 problem of Wang, Tang, and Ding concerns the isomorphism associated with the Witt 44-(11,5,1)(11,5,1) design and its related coding-theory data.

Known results

  • Gavrilyuk and Suda (2023) proved that the association scheme on the blocks of the Witt 44-(11,5,1)(11,5,1) design is unique up to isomorphism given its parameters.

October 2026 preprint claim

Wei, Qiang, and Hong claim to prove the requested isomorphism and derive the associated code parameters and weight enumerators. The result is presented in an unrefereed preprint; no independent verification or proof-gap analysis was found.

Current status (as of October 2026): The specifically posed problem is claimed solved by an unrefereed preprint, while broader Witt-design questions are not addressed.

Sources

Solutions 0

No solutions have been posted yet.