Codes from incidence matrices and line graphs of Hamming graphs
From MaRDI portal
(Redirected from Publication:973112)
Recommendations
Cites work
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 53917 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1284430 (Why is no real title available?)
- Binary codes from the line graph of the \(n\)-cube
- Codes associated with triangular graphs and permutation decoding
- Codes from incidence matrices of graphs
- Codes from lattice and related graphs, and permutation decoding
- Codes, designs and groups from the Hamming graphs
- Congruent Graphs and the Connectivity of Graphs
- Graphs, designs and codes related to the \(n\)-cube
- Information sets and partial permutation decoding for codes from finite geometries
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)
- On coverings
- PD-sets for the codes related to some classical varieties
- Partial permutation decoding for codes from finite planes
- Permutation Decoding of Systematic Codes
- The Magma algebra system. I: The user language
Cited in
(29)- Codes from incidence matrices of graphs
- GHWs of codes derived from the incidence matrices of some graphs
- More Fibonacci-Bernoulli relations with and without balancing polynomials
- Codes, designs and groups from the Hamming graphs
- Codes from incidence matrices of some Bouwer graphs
- Codes from incidence matrices of some regular graphs
- Codes from lattice and related graphs, and permutation decoding
- Codes associated with the odd graphs
- Binary codes from Paley graphs of prime-power-square order
- A characterization of graphs by codes from their incidence matrices
- The weight distribution of hulls of binary codes from incidence matrices of complete graphs
- Codes from the incidence matrices of graphs on 3-sets
- Binary codes from the line graph of the \(n\)-cube
- scientific article; zbMATH DE number 7424440 (Why is no real title available?)
- Construction of linear codes from the unit graph \(G(\mathbb{Z}_n)\)
- Permutation decoding of codes from generalized Paley graphs
- Binary codes from \(m\)-ary \(n\)-cubes \(Q^m_n\)
- \(LCD\) codes from adjacency matrices of graphs
- The graphs of non-degenerate linear codes
- Codes from incidence matrices of \((n, 1)\)-arrangement graphs and \((n, 2)\)-arrangement graphs
- Hulls of codes from incidence matrices of connected regular graphs
- Intersection of Hamming codes avoiding Hamming subcodes
- Codes from the incidence matrices and line graphs of Hamming graphs \(H^k(n,2)\) for \(k \geq 2\)
- Codes from incidence matrices and line graphs of Paley graphs
- Binary codes and partial permutation decoding sets from biadjacency matrices of the bipartite graphs \(\Gamma (2k+1,k,k+2,1)\)
- Linear codes and cyclic codes over finite rings and their generalizations: a survey
- Binary codes and partial permutation decoding sets from biadjacency matrices of bipartite graphs \(\Gamma (2k, k, k + 1, 1)\)
- Hamming graphs and special LCD codes
- GHWs of codes arising from Cartesian product of graphs
This page was built for publication: Codes from incidence matrices and line graphs of Hamming graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q973112)
