Codes from the incidence matrices and line graphs of Hamming graphs \(H^k(n,2)\) for \(k \geq 2\)
From MaRDI portal
Publication:2275889
DOI10.3934/amc.2011.5.373zbMath1223.05165OpenAlexW2030493723MaRDI QIDQ2275889
Eric Mwambene, Jennifer D. Key, Washiela Fish
Publication date: 10 August 2011
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2011.5.373
Combinatorial aspects of block designs (05B05) Linear codes (general theory) (94B05) Eulerian and Hamiltonian graphs (05C45)
Related Items
Codes from neighbourhood designs of the graphs \(\text{GP}(q,\frac{q-1}{2})\) with \(q\) odd ⋮ GHWs of codes arising from Cartesian product of graphs ⋮ \(LCD\) codes from adjacency matrices of graphs ⋮ GHWs of codes derived from the incidence matrices of some graphs ⋮ Permutation decoding of codes from generalized Paley graphs ⋮ Codes associated with the odd graphs ⋮ A characterization of graphs by codes from their incidence matrices ⋮ Binary codes and partial permutation decoding sets from biadjacency matrices of bipartite graphs Γ(2k, k, k + 1, 1) ⋮ Codes from incidence matrices of graphs ⋮ Hulls of codes from incidence matrices of connected regular graphs ⋮ Codes and designs from triangular graphs and their line graphs ⋮ Hamming graphs and special LCD codes ⋮ Codes from the incidence matrices of graphs on 3-sets ⋮ Generalized Hamming weights of projective Reed-Muller-type codes over graphs ⋮ Codes from incidence matrices of some Bouwer graphs ⋮ Codes from incidence matrices of some regular graphs ⋮ Codes from incidence matrices of (n, 1)-arrangement graphs and (n, 2)-arrangement graphs
Uses Software
This page was built for publication: Codes from the incidence matrices and line graphs of Hamming graphs \(H^k(n,2)\) for \(k \geq 2\)
