Lexi-bounds conjecture for short linear codes and saturating sets
Let be the length function, let be the -length function, let be the smallest size of a -saturating set in , and let be the smallest size of a complete arc in . Lexi-bounds conjecture. The following upper bounds hold:
for all , and
for all . These bounds improve earlier constants and connect short linear codes with saturating sets and complete arcs; the source presents them as conjectural bounds based on computational observations.
References
- Daniele Bartoli, Alexander A. Davydov, Stefano Marcugini and Fernanda Pambianco, “Tables, bounds and graphics of short linear codes with covering radius 3 and codimension 4 and 5”, arXiv:1712.07078 (2020).
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.