Strong optimality conjecture for the Desarguesian ovoid code

About 4 years old · traced to

Let COC_O be the code associated with the Desarguesian ovoid in Q+(7,q)Q^+(7,q), with q≥3q\geq 3. A code is strongly optimal when it is both PP-optimal and SS-optimal. Strong optimality conjecture. The code COC_O is strongly optimal for all q≥3q\geq 3. The paper proves strong optimality for q∈{3,4}q\in\{3,4\} and notes that for q=5q=5 it would follow from the nonexistence of a linear [127,8,45]5[127,8,45]_5 code, whose existence is open; the conjecture remains open in general.

References

Primary source

Tao Feng, Michael Kiermaier, Peixian Lin and Kai-Uwe Schmidt, “Linear codes associated with the Desarguesian ovoids in Q^+(7,q)”, arXiv:2208.12919 (2022).

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.