Metraipolis › archive › dc_0b5bdf29d75e
Optimal self-orthogonal binary linear codes — arXiv:2610.39870
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.39870
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:38:00.827Z
- SHA-256 of the archived text
fd55eaf6b8992cabdcdb3387baccbdfbe8e9a2067ba2fb2e8953a5cb2ca9c474- Stable URL of this page
https://metraipolis.com/documento/dc_0b5bdf29d75e
How to cite
Optimal self-orthogonal binary linear codes — arXiv:2610.39870 — arXiv (en), https://arxiv.org/abs/2610.39870 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0b5bdf29d75e (Metraipolis archive dc_0b5bdf29d75e, sha256 fd55eaf6b8992cabdcdb3387baccbdfbe8e9a2067ba2fb2e8953a5cb2ca9c474)
BibTeX
@misc{dc0b5bdf29d75e,
title = {Optimal self-orthogonal binary linear codes — arXiv:2610.39870},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.39870},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0b5bdf29d75e; sha256 fd55eaf6b8992cabdcdb3387baccbdfbe8e9a2067ba2fb2e8953a5cb2ca9c474},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.39870. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We complete the determination of the minimum possible length of eight-dimensional binary self-orthogonal codes with given minimum distance. For dimension nine we give exact values and bounds for minimum distance at most $64$. By exploiting the geometric reformulation of linear codes as multisets of points, we fully redo the classification for dimension at most seven in a simplified and computer-free manner. As a by-product we prove the non-existence of $[93,9,44]_2$ codes and show several divisibility results for putative optimal nine-dimensional binary codes. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno). Categorie arXiv: Combinatorics (math.CO) ; Discrete Mathematics (cs.DM); Information Theory (cs.IT). Pagina del lavoro: https://arxiv.org/abs/2610.39870 — 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-11-01T02:15:28.284Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).