Codes from incidence matrices of some regular graphs
From MaRDI portal
Recommendations
- Codes from incidence matrices of graphs
- Codes from incidence matrices and line graphs of Hamming graphs
- Codes from incidence matrices of (n, 1)-arrangement graphs and (n, 2)-arrangement graphs
- Codes from the incidence matrices and line graphs of Hamming graphs H^k(n,2) for k 2
- Codes from incidence matrices and line graphs of Paley graphs
Cites work
- Binary codes and permutation decoding sets from the graph products of cycles
- Binary codes from the line graph of the \(n\)-cube
- 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 incidence matrices and line graphs of Paley graphs
- Codes from lattice and related graphs, and permutation decoding
- Codes from multipartite graphs and minimal permutation decoding sets
- Codes from the incidence matrices and line graphs of Hamming graphs H^k(n,2) for k 2
- Codes from the incidence matrices of graphs on 3-sets
- Codes from the line graphs of complete multipartite graphs and PD-sets
- Desargues' and Pappus' Graphs and Their Groups
- Edge-transitive graphs and combinatorial designs
- scientific article; zbMATH DE number 3097897 (Why is no real title available?)
- Information sets and partial permutation decoding for codes from finite geometries
- Lee distance and topological properties of k-ary n-cubes
- On the Levi graph of point-line configurations
- Permutation decoding for the binary codes from triangular graphs.
- Permutation Decoding of Systematic Codes
- Regular line-symmetric graphs
- Self-dual configurations and regular graphs
- Semisymmetry of generalized Folkman graphs
Cited in
(12)- PD-sets for the codes from incidence matrices of triangular graphs
- Binary codes of some strongly regular subgraphs of the McLaughlin graph
- Codes from incidence matrices of graphs
- Codes from the incidence matrices and line graphs of Hamming graphs H^k(n,2) for k 2
- Hulls of codes from incidence matrices of connected regular graphs
- A characterization of graphs by codes from their incidence matrices
- Codes from incidence matrices of some Bouwer graphs
- Codes from incidence matrices of (n, 1)-arrangement graphs and (n, 2)-arrangement graphs
- Identifying codes with small radius in some infinite regular graphs
- On zero-divisor graph of the ring \(\mathbb{F}_p +u\mathbb{F}_p +u^2 \mathbb{F}_p\)
- Codes from incidence matrices of hypergraphs
- Codes from incidence matrices and line graphs of Hamming graphs
This page was built for publication: Codes from incidence matrices of some regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5013485)
