Metraipolis › archive › dc_70b80d355d54
A proof of the Braun-Etzion-Vardy bound for binary subspace codes — arXiv:2609.33719
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.33719
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T23:29:27.763Z
- SHA-256 of the archived text
15f1b294c65faca976eb7d74a93825acaec2edf2d61aecb50d9b6cb2d7aa15d4- Stable URL of this page
https://metraipolis.com/documento/dc_70b80d355d54
How to cite
A proof of the Braun-Etzion-Vardy bound for binary subspace codes — arXiv:2609.33719 — arXiv (en), https://arxiv.org/abs/2609.33719 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_70b80d355d54 (Metraipolis archive dc_70b80d355d54, sha256 15f1b294c65faca976eb7d74a93825acaec2edf2d61aecb50d9b6cb2d7aa15d4)
BibTeX
@misc{dc70b80d355d54,
title = {A proof of the Braun-Etzion-Vardy bound for binary subspace codes — arXiv:2609.33719},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.33719},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_70b80d355d54; sha256 15f1b294c65faca976eb7d74a93825acaec2edf2d61aecb50d9b6cb2d7aa15d4},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.33719. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The notion of a linear subspace code in a projective space was introduced by Braun, Etzion and Vardy (2013), who conjectured that a linear subspace code in the projective space has at most 2^n codewords. We resolve this conjecture. A novel character-theoretic argument is used to prove the conjecture and the proof is self-contained. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-29 in math.CO). Categorie arXiv: Information Theory (cs.IT) ; Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2609.33719 — 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-07T23:08:10.905Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).