The graphs of non-degenerate linear codes
From MaRDI portal
Publication:2680824
DOI10.1016/j.jcta.2022.105720zbMath1504.51006arXiv2203.06625OpenAlexW4311424083MaRDI QIDQ2680824
Publication date: 4 January 2023
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.06625
Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Linear codes and caps in Galois spaces (51E22)
Related Items (3)
On the graph of non-degenerate linear \([n,2_2\) codes] ⋮ Grassmannians of codes ⋮ On maximal cliques in the graph of simplex codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the distance between linear codes
- Points and lines. Characterizing the classical geometries
- Isometries of Grassmann spaces
- The graphs of projective codes
- On the Grassmann graph of linear codes
- The graph of 4-ary simplex codes of dimension 2
- Chow's theorem for linear codes
- Wigner's theorem on Grassmann spaces
- On the geometry of algebraic homogeneous spaces
- Diagram Geometry
- Grassmannians of Classical Buildings
- Wigner-Type Theorems for Hilbert Grassmannians
- Geometry of Semilinear Embeddings
This page was built for publication: The graphs of non-degenerate linear codes
