The graph of 4-ary simplex codes of dimension 2

DOI10.1016/J.FFA.2020.101709MaRDI QIDQ1994924zbMATH OpenOpenAlexFDO

Authors M. Kwiatkowski, Mark 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 graphsGrassmann graphlinear codesimplex code

Mathematics Subject Classification ID

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

Recommendations

• The graphs of projective codes
• scientific article; zbMATH DE number 1504662
• A new distance-regular graph of diameter 3 on 1024 vertices
• On the distance between linear codes
• On the cosets of the simplex code

Cites work

• Algebraic geometric codes. Basic notions
• Fundamentals of Error-Correcting Codes
• Geometry of semilinear embeddings. Relations to graphs and codes
• scientific article; zbMATH DE number 3894973 (Why is no real title available?)
• On the distance between linear codes
• The graphs of projective codes

Cited in

(6)

• The graphs of projective codes
• The graphs of non-degenerate linear codes
• 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
• One class of maximal cliques in the collinearity graphs of geometries related to simplex codes

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

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