Metraipolis › archive › dc_dd950f21da38

A new upper bound for Sidon sets in $\mathbb{F}_2^{4k+3}$ — arXiv:2609.27731

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.27731
License (as archived)
CC0-1.0
Archived
2026-10-08T12:12:06.764Z
SHA-256 of the archived text
97dca755c157c9cc8456a083be9f03c44e0b24d19a861972477d24ccc0096cf6
Stable URL of this page
https://metraipolis.com/documento/dc_dd950f21da38

How to cite

A new upper bound for Sidon sets in $\mathbb{F}_2^{4k+3}$ — arXiv:2609.27731 — arXiv (en), https://arxiv.org/abs/2609.27731 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_dd950f21da38 (Metraipolis archive dc_dd950f21da38, sha256 97dca755c157c9cc8456a083be9f03c44e0b24d19a861972477d24ccc0096cf6)
BibTeX
@misc{dcdd950f21da38,
  title = {A new upper bound for Sidon sets in $mathbbF_2^4k+3$ — arXiv:2609.27731},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.27731},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_dd950f21da38; sha256 97dca755c157c9cc8456a083be9f03c44e0b24d19a861972477d24ccc0096cf6},
  year = {2026}
}

Archived text

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

A subset $S \subseteq \mathbb{F}_2^n$ is called a Sidon set if no four distinct points of $S$ have zero sum. It is shown that if $n \geq 7$ and $n \equiv 3 \mod 4$, then $|S|\leq 2^{\frac{n+1}{2}}-3$. As a consequence, for any even $t \geq 4$, there does not exist a binary linear $[2^t-3,2^t-2t-2,5]$-code, strengthening a nonexistence result of Brouwer and Tolhuizen from 1993. As a second consequence, we also show that for an even integer $n \geq 4$, every almost perfect nonlinear (APN) function $F \colon \mathbb{F}_2^n \to \mathbb{F}_2^n$ has nonlinearity at least $3$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-24 in math.IT).
Categorie arXiv: Combinatorics (math.CO) ; Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2609.27731 — 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-08T12:10:03.946Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-24?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).