On the Grassmann graph of linear codes

DOI10.1016/J.FFA.2021.101895MaRDI QIDQ1979960zbMATH OpenOpenAlexFDO

Authors M. Kwiatkowski, Ilaria Cardinali, Luca Giuzzi

Publication date 3 September 2021

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

Full work available at URL https://arxiv.org/abs/2005.04402, http://hdl.handle.net/11379/545596

zbMATH Keywords

diameterlinear codesGrassmann graph

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: Let $Gamma(n,k)$ be the Grassmann graph formed by the $k$-dimensional subspaces of a vector space of dimension $n$ over a field $mathbbF$ and, for $tinmathbbNsetminus0$, let $Delt{a}_t(n,k)$ be the subgraph of $Gamma(n,k)$ formed by the set of linear $[n,k]$-codes having minimum dual distance at least $t+1$. We show that if $|mathbbF|geqnchooset$ then $Delt{a}_t(n,k)$ is connected and it is isometrically embedded in $Gamma(n,k)$. This generalizes some results of [M. Kwiatkowski, M. Pankov, "On the distance between linear codes", Finite Fields Appl. 39 (2016), 251--263] and [M. Kwiatkowski, M. Pankov, A. Pasini, "The graphs of projective codes" Finite Fields Appl. 54 (2018), 15--29].

Recommendations

• On the distance between linear codes
• The graphs of non-degenerate linear codes
• The graphs of projective codes
• On the graph of non-degenerate linear \([n,2]_2\) codes
• Embeddings of Grassmann graphs
• Covering of subspaces by subspaces
• Codes and anticodes in the Grassman graph
• A characterization of Grassmann graphs
• Chow's theorem for linear codes
• The polynomial degree of the Grassmannian \(G(1,n,q)\) of lines in finite projective space \(PG(n,q)\)

Cites work

• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• On the distance between linear codes
• Points and lines. Characterizing the classical geometries
• The graphs of projective codes

Cited in

(19)

• Linear codes over signed graphs
• Grassmannians of codes
• Linear codes and cyclic codes over finite rings and their generalizations: a survey
• A construction of linear codes and strongly regular graphs from \(q\)-polynomials
• Codes on graphs: normal realizations
• The graphs of non-degenerate linear codes
• Grassmannian frames with applications to coding and communication
• On coset leader graphs of structured linear codes
• Codes on linear sections of the Grassmannian
• On Lagrangian-Grassmannian codes
• A NOTE ON LINEAR CODES FROM JOHNSON GRAPHS
• Codes and caps from orthogonal Grassmannians
• On maximal cliques in the graph of simplex codes
• The graphs of projective codes
• Point-line geometries related to binary equidistant codes
• On the graph of non-degenerate linear \([n,2]_2\) codes
• Codes and anticodes in the Grassman graph
• Chow's theorem for linear codes
• Enumerative coding for line polar Grassmannians with applications to codes

This page was built for publication: On the Grassmann graph of linear codes

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