Grassmannians of codes

DOI10.1016/j.ffa.2023.102342arXiv2304.08397MaRDI QIDQ6144449

Luca Giuzzi, Ilaria Cardinali

Publication date: 29 January 2024

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2304.08397

zbMATH Keywords

linear codespoint-line geometryconnectivityGrassmann graph

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Linear codes and caps in Galois spaces (51E22)

Related Items (1)

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
• On saturating sets in projective spaces.
• On transparent embeddings of point-line geometries
• The graphs of projective codes
• On the Grassmann graph of linear codes
• New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces
• Chow's theorem for linear codes
• The graphs of non-degenerate linear codes
• On Isometric Embeddings of Graphs

This page was built for publication: Grassmannians of codes