On maximal cliques in the graph of simplex codes

DOI10.1007/s00022-023-00709-yarXiv2308.06109OpenAlexW4391215055WikidataQ129308844 ScholiaQ129308844MaRDI QIDQ6202493

Mariusz Kwiatkowski, M. A. Pankov

Publication date: 26 February 2024

Published in: Journal of Geometry (Search for Journal in Brave)

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

zbMATH Keywords

Grassmann graphequidistant codesimplex code

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Linear codes and caps in Galois spaces (51E22) Graph theory (05C99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the distance between linear codes
• Points and lines. Characterizing the classical geometries
• The graphs of projective codes
• An introduction to divisible codes
• On the Grassmann graph of linear codes
• The graph of 4-ary simplex codes of dimension 2
• Chow's theorem for linear codes
• The graphs of non-degenerate linear codes
• Diagram Geometry
• Grassmannians of Classical Buildings
• Fundamentals of Error-Correcting Codes
• On the graph of non-degenerate linear \([n,2_2\) codes]
• Grassmannians of codes

This page was built for publication: On maximal cliques in the graph of simplex codes