Codes from incidence matrices of (n, 1)-arrangement graphs and (n, 2)-arrangement graphs
From MaRDI portal
Publication:5865693
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
Cites work
- scientific article; zbMATH DE number 1284430 (Why is no real title available?)
- Arrangement graphs: A class of generalized star graphs
- Binary codes of strongly regular graphs
- Codes and designs from triangular graphs and their line graphs
- Codes associated with triangular graphs and permutation decoding
- Codes from incidence matrices and line graphs of Hamming graphs
- Codes from lattice and related graphs, and permutation decoding
- 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
- Permutation Decoding of Systematic Codes
- Permutation decoding for the binary codes from triangular graphs.
- The automorphism group of the alternating group graph
Cited in
(5)- Codes from incidence matrices of some Bouwer graphs
- Codes from incidence matrices of some regular graphs
- On the code generated by the incidence matrix of points and \(k\)-spaces in \(\text{PG}(n,q)\) and its dual
- Hulls of codes from incidence matrices of connected regular graphs
- Codes from the incidence matrices and line graphs of Hamming graphs \(H^k(n,2)\) for \(k \geq 2\)
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)
