Metraipolis › archive › dc_99ff63dc0b03

Nonlinear fixed-distance codes via real lifts of moment configurations — arXiv:2610.19960

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.19960
License (as archived)
CC0-1.0
Archived
2026-10-15T14:36:15.666Z
SHA-256 of the archived text
06588a8bab4876630c06f70bf25de7d184f7b823be0827f7984671911106be34
Stable URL of this page
https://metraipolis.com/documento/dc_99ff63dc0b03

How to cite

Nonlinear fixed-distance codes via real lifts of moment configurations — arXiv:2610.19960 — arXiv (en), https://arxiv.org/abs/2610.19960 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_99ff63dc0b03 (Metraipolis archive dc_99ff63dc0b03, sha256 06588a8bab4876630c06f70bf25de7d184f7b823be0827f7984671911106be34)
BibTeX
@misc{dc99ff63dc0b03,
  title = {Nonlinear fixed-distance codes via real lifts of moment configurations — arXiv:2610.19960},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.19960},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_99ff63dc0b03; sha256 06588a8bab4876630c06f70bf25de7d184f7b823be0827f7984671911106be34},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.19960. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Let $A_q(n,d)$ denote the largest size of a code of length $n$ and minimum Hamming distance $d$ over an alphabet of $q$ symbols. For fixed $q\ge2$ and $d\ge4$ we construct codes with redundancy $n-\log_q A_q(n,d)\le(d-3)\log_q n+O(\sqrt{\log n})$ for all large $n$. No algebraic structure is imposed on the alphabet, and the codes are not linear. For $d=4$ and $d=5$ the coefficient of $\log_q n$ matches the Hamming bound, so the redundancy is determined up to lower-order terms. At distance four the codes are provably better than every linear code: by the polynomial-method bound for cap sets, $\mathbb{F}_q$-linear codes with $q>2$ require a strictly larger coefficient in front of $\log_q n$. The construction imposes moment checksums over an auxiliary finite field, as BCH codes do, but one fewer than the distance would normally require. The affine-line theorem from prior work describes the dependencies left by these checks. We exclude them by placing the code positions inside a specially structured subset of the field, built from Behrend's sphere construction with the help of algebraic number theory.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Information Theory (cs.IT) ; Discrete Mathematics (cs.DM); Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.19960 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-15T13:57:05.399Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).