Codes from incidence matrices of (n, 1)-arrangement graphs and (n, 2)-arrangement graphs

DOI10.1080/09720529.2019.1681674zbMath1492.94208OpenAlexW3009344917MaRDI QIDQ5865693

No author found.

Publication date: 9 June 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2019.1681674

zbMATH Keywords

incidence matrixlinear codeedge transitivearrangement graphneighbourhood designs

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Unnamed Item
• Codes from lattice and related graphs, and permutation decoding
• The automorphism group of the alternating group graph
• Codes associated with triangular graphs and permutation decoding
• Codes and designs from triangular graphs and their line graphs
• Codes from incidence matrices and line graphs of Hamming graphs
• Arrangement graphs: A class of generalized star graphs
• Permutation decoding for the binary codes from triangular graphs.
• Binary codes of strongly regular graphs
• Codes from the incidence matrices of graphs on 3-sets
• Codes from the incidence matrices and line graphs of Hamming graphs \(H^k(n,2)\) for \(k \geq 2\)
• Permutation Decoding of Systematic Codes

This page was built for publication: Codes from incidence matrices of (n, 1)-arrangement graphs and (n, 2)-arrangement graphs