Codes from incidence matrices of (n, 1)-arrangement graphs and (n, 2)-arrangement graphs
From MaRDI portal
Publication:5865693
DOI10.1080/09720529.2019.1681674zbMATH Open1492.94208OpenAlexW3009344917MaRDI QIDQ5865693FDOQ5865693
Authors:
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
Recommendations
- Codes from incidence matrices of some regular graphs
- Codes from incidence matrices of graphs
- Codes from incidence matrices and line graphs of Hamming graphs
- Codes from the incidence matrices and line graphs of Hamming graphs \(H^k(n,2)\) for \(k \geq 2\)
- Codes from the incidence matrices of graphs on 3-sets
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Paths and cycles (05C38) Linear codes (general theory) (94B05)
Cites Work
- Arrangement graphs: A class of generalized star graphs
- Title not available (Why is that?)
- Permutation Decoding of Systematic Codes
- Binary codes of strongly regular graphs
- Permutation decoding for the binary codes from triangular graphs.
- Codes from the incidence matrices and line graphs of Hamming graphs \(H^k(n,2)\) for \(k \geq 2\)
- Codes from lattice and related graphs, and permutation decoding
- Codes associated with triangular graphs and permutation decoding
- Codes from incidence matrices and line graphs of Hamming graphs
- Codes from the incidence matrices of graphs on 3-sets
- The automorphism group of the alternating group graph
- Codes and designs from triangular graphs and their line graphs
Cited In (5)
- On the code generated by the incidence matrix of points and \(k\)-spaces in \(\text{PG}(n,q)\) and its dual
- Codes from the incidence matrices and line graphs of Hamming graphs \(H^k(n,2)\) for \(k \geq 2\)
- Hulls of codes from incidence matrices of connected regular graphs
- Codes from incidence matrices of some Bouwer graphs
- Codes from incidence matrices of some regular graphs
This page was built for publication: Codes from incidence matrices of \((n, 1)\)-arrangement graphs and \((n, 2)\)-arrangement graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5865693)
