Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 57 min ago
PreprintarXiv licencearXiv

A proof of the Braun-Etzion-Vardy bound for binary subspace codes

  • Srikanth B. Pai
Open at sourcePDFDOICite

Abstract

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.

Related

  1. Algebraic-Geometric Parvaresh--Vardy Subspace Designs and Rank Condensers
    Gil Cohen, Dean Doron, Noam Goldgraber
    arXivPreprintCC0Full textGeneral mathematicsarXiv
  2. A machine-checked proof of the Dong-Yang classification of optimal (n,4) binary codes for BSCs
    Shenghao Yang, Yanyan Dong
    arXivPreprintCC BY-NC-SA 4.0Full textGeneral mathematicsarXiv
  3. Proof of a conjecture of Johnston on binary matrices with low discrepancy
    Shalom Eliahou
    HALPreprintCC BY-NC-ND 4.0Full textGeneral mathematicsHAL
  4. A Short Proof and Generalization of the Rainbow Cycle Theorem and Improved Bounds for Binary Even-Query LCCs
    Andrew D. Lin
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  5. Subspace concentration condition and Bogomolov--Gieseker inequality
    Carl Tipler
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryGeometry & topologyarXiv

Cite

BibTeXRIS
BibTeX
@misc{pai2026proof,
  title = {{A proof of the Braun-Etzion-Vardy bound for binary subspace codes}},
  author = {Srikanth B. Pai},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.33719},
  eprint = {2609.33719},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.33719},
}
RIS
TY  - UNPB
TI  - A proof of the Braun-Etzion-Vardy bound for binary subspace codes
AU  - Srikanth B. Pai
PY  - 2026
DA  - 2026/09/27
PB  - arXiv
DO  - 10.48550/arxiv.2609.33719
UR  - https://arxiv.org/abs/2609.33719
AB  - 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.
ER  -