Ding–Li conjecture on Steiner systems from dual ternary codes

About 7 years old · traced to

Let m≥3m\ge 3 be an odd integer, let α\alpha be a primitive element of GF⁡(3m)\operatorname{GF}(3^m), and let C1\mathcal C_1 and C2\mathcal C_2 be the ternary linear codes defined above. For i∈1,2i\in\\{1,2\\}, let Ci⊥\mathcal C_i^{\perp} be the dual code, and let P(Ci⊥)\mathcal P(\mathcal C_i^{\perp}) and B4(Ci⊥)\mathcal B_4(\mathcal C_i^{\perp}) denote its point set and the supports of its weight-44 codewords. Ding–Li's Steiner-system conjecture. Then

(P(Ci⊥),B4(Ci⊥))(\mathcal P(\mathcal C_i^{\perp}),\mathcal B_4(\mathcal C_i^{\perp}))

is a Steiner system S(2,4,3m−12)S(2,4,\frac{3^m-1}{2}). The claim predicts Steiner systems obtained from the minimum-weight words of the dual codes; the supplied text gives no resolution status.

References

Primary source

Chunming Tang, Cunsheng Ding and Maosheng Xiong, “Steiner systems S(2, 4, 3^m-12) and 2-designs from ternary linear codes of length 3^m-12”, arXiv:1901.09228 (2019).

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.