The graph of 4-ary simplex codes of dimension 2

DOI10.1016/j.ffa.2020.101709zbMath1459.05064OpenAlexW3041958168MaRDI QIDQ1994924

Mariusz Kwiatkowski, M. A. Pankov

Publication date: 18 February 2021

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

Full work available at URL: https://doi.org/10.1016/j.ffa.2020.101709

zbMATH Keywords

distance in graphslinear codeGrassmann graphsimplex code

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Distance in graphs (05C12) Connectivity (05C40)

Related Items (3)

On the graph of non-degenerate linear \([n,2_2\) codes] ⋮ The graphs of non-degenerate linear codes ⋮ On maximal cliques in the graph of simplex codes

Cites Work

• Unnamed Item
• Unnamed Item
• On the distance between linear codes
• The graphs of projective codes
• Fundamentals of Error-Correcting Codes
• Geometry of Semilinear Embeddings

This page was built for publication: The graph of 4-ary simplex codes of dimension 2