Metraipolis › archive › dc_cc9bf040025f

Infinite families of 3-designs from linear and nonlinear codes — arXiv:2609.15525

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.15525
License (as archived)
CC0-1.0
Archived
2026-10-16T01:34:46.392Z
SHA-256 of the archived text
04f2ff7ba58bec57b8d10494a44847a226b9f74233c809e1060f00bdcc02b9b8
Stable URL of this page
https://metraipolis.com/documento/dc_cc9bf040025f

How to cite

Infinite families of 3-designs from linear and nonlinear codes — arXiv:2609.15525 — arXiv (en), https://arxiv.org/abs/2609.15525 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cc9bf040025f (Metraipolis archive dc_cc9bf040025f, sha256 04f2ff7ba58bec57b8d10494a44847a226b9f74233c809e1060f00bdcc02b9b8)
BibTeX
@misc{dccc9bf040025f,
  title = {Infinite families of 3-designs from linear and nonlinear codes — arXiv:2609.15525},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.15525},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cc9bf040025f; sha256 04f2ff7ba58bec57b8d10494a44847a226b9f74233c809e1060f00bdcc02b9b8},
  year = {2026}
}

Archived text

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

The connection between coding theory and combinatorial $t$-designs is an important research topic at the intersection of coding theory and combinatorics. Let $q=p^m$, where $p$ is an odd prime and $m\geq 2$. In this paper, we investigate a class of linear codes $\mathcal{C}$ over $\mathbb{F}_{q^2}$ and their connection with combinatorial $3$-designs. By analyzing the relevant structural properties of $\mathcal{C}$ and $\mathcal{C}^{\perp}$, we show that the supports of the codewords of every nonzero weight in $\mathcal{C}$ and {the supports of the codewords of weight $4$ in $\mathcal{C}^{\perp}$} form $3$-designs. We further investigate a class of nonlinear codes $\mathcal{C}_2$ associated with $\mathcal{C}$, and prove that the supports of the codewords of every nonzero Hamming weight in $\mathcal{C}_2$ also form $3$-designs. These results identify further classes of linear and nonlinear codes whose codewords support combinatorial $3$-designs. In particular, the nonlinear case provides additional examples of codes supporting $3$-designs, a topic for which relatively few results are currently available. As applications, we construct from $\mathcal{C}^{\perp}$ an entanglement-assisted quantum error-correcting code with parameters $[[q+1,q-3,4;4]]_q$. We also prove that $\mathcal{C}$ is an all-symbol locally repairable code with locality $3$. Furthermore, we show that the code $\mathcal{C}$ {meets the Singleton-type bound for locally repairable codes} and hence is optimal in some cases.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.IT).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2609.15525 — 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-16T01:21:38.625Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).