Grassmannians of codes

DOI10.1016/J.FFA.2023.102342MaRDI QIDQ6144449zbMATH OpenFDO

Authors Ilaria Cardinali, Luca Giuzzi

Publication date 29 January 2024

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

connectivityGrassmann graphlinear codespoint-line geometry

Mathematics Subject Classification ID

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

Abstract: Consider the point line-geometry ${mathcalP}_t(n,k)$ having as points all the $[n,k]$-linear codes having minimum dual distance at least $t+1$ and where two points $X$ and $Y$ are collinear whenever $XcapY$ is a $[n,k-1]$-linear code having minimum dual distance at least $t+1$. We are interested in the collinearity graph $Lambd{a}_t(n,k)$ of ${mathcalP}_t(n,k).$ The graph $Lambd{a}_t(n,k)$ is a subgraph of the Grassmann graph and also a subgraph of the graph $Delt{a}_t(n,k)$ of the linear codes having minimum dual distance at least $t+1$ introduced in~[M. Kwiatkowski, M. Pankov, On the distance between linear codes, Finite Fields Appl. 39 (2016), 251--263, doi:10.1016/j.ffa.2016.02.004, arXiv:1506.00215]. We shall study the structure of $Lambd{a}_t(n,k)$ in relation to that of $Delt{a}_t(n,k)$ and we will characterize the set of its isolated vertices. We will then focus on $Lambd{a}_1(n,k)$ and $Lambd{a}_2(n,k)$ providing necessary and sufficient conditions for them to be connected.

Recommendations

• On the Grassmann graph of linear codes
• On the distance between linear codes
• The graphs of projective codes
• On the graph of non-degenerate linear \([n,2]_2\) codes
• The graphs of non-degenerate linear codes

Cites work

• Chow's theorem for linear codes
• Graph theory with applications
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 743695 (Why is no real title available?)
• New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces
• On Isometric Embeddings of Graphs
• On saturating sets in projective spaces.
• On the distance between linear codes
• On the Grassmann graph of linear codes
• On transparent embeddings of point-line geometries
• Points and lines. Characterizing the classical geometries
• The graphs of non-degenerate linear codes
• The graphs of projective codes

Cited in

(3)

• On the graph of non-degenerate linear \([n,2]_2\) codes
• On maximal cliques in the graph of simplex codes
• Point-line geometries related to binary equidistant codes

This page was built for publication: Grassmannians of codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6144449)