Point-line geometries related to binary equidistant codes
From MaRDI portal
Publication:6650524
DOI10.1016/J.JCTA.2024.105962MaRDI QIDQ6650524
K. Petelczyc, Mark Pankov, M. Żynel
Publication date: 9 December 2024
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
equidistant codesimplex codepartial Steiner triple systemPasch configurationCremona-Richmond configuration
Theory of error-correcting codes and error-detecting codes (94Bxx) Graph theory (05Cxx) Finite geometry and special incidence structures (51Exx)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the distance between linear codes
- Embedding partial triple systems
- 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
- An extension of a theorem of the Bruijn and Erdős on combinatorial designs
- The graphs of non-degenerate linear codes
- Fundamentals of Error-Correcting Codes
- Geometry of Semilinear Embeddings
- Embedding partial Steiner triple systems so that their automorphisms extend
- Grassmannians of codes
- On maximal cliques in the graph of simplex codes
This page was built for publication: Point-line geometries related to binary equidistant codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6650524)
