For every even n, the code-based construction yields explicit [3,1]-avoiders in F_2^n of at least roughly 2^{n/12}/sqrt(n) different sizes.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Code-based $[3,1]$-avoiders in finite affine spaces $\mathrm{AG}(n,2)$
For every even n, the code-based construction yields explicit [3,1]-avoiders in F_2^n of at least roughly 2^{n/12}/sqrt(n) different sizes.