On the graph of non-degenerate linear \([n,2]_2\) codes

DOI10.1016/j.ffa.2023.102282zbMath1526.05103arXiv2301.06012MaRDI QIDQ6063240

M. A. Pankov

Publication date: 7 November 2023

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

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

zbMATH Keywords

linear codeGrassmann graphgraph of linear codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

On maximal cliques in the graph of simplex codes

Cites Work

• On the distance between linear codes
• Points and lines. Characterizing the classical geometries
• The graphs of projective codes
• Partial lineations between arguesian projective spaces
• On the Grassmann graph of linear codes
• The graph of 4-ary simplex codes of dimension 2
• Chow's theorem for linear codes
• On the geometry of algebraic homogeneous spaces
• The graphs of non-degenerate linear codes
• Diagram Geometry
• Grassmannians of Classical Buildings
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the graph of non-degenerate linear \([n,2]_2\) codes