Graphs, designs and codes related to the \(n\)-cube
From MaRDI portal
Publication:1025949
DOI10.1016/j.disc.2008.09.024zbMath1228.05072OpenAlexW2032343773MaRDI QIDQ1025949
Eric Mwambene, Jennifer D. Key, Washiela Fish
Publication date: 23 June 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.09.024
Combinatorial aspects of block designs (05B05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial codes (94B25)
Related Items
Codes from neighbourhood designs of the graphs \(\text{GP}(q,\frac{q-1}{2})\) with \(q\) odd, \(LCD\) codes from adjacency matrices of graphs, Unnamed Item, Minimal PD-sets for codes associated with the graphs \(Q^m_2, m\) even, Hamming graphs and special LCD codes, Codes from incidence matrices and line graphs of Hamming graphs, Binary codes from the line graph of the \(n\)-cube, Binary codes from \(m\)-ary \(n\)-cubes \(Q^m_n\)
Uses Software
Cites Work
- Binary codes from the line graph of the \(n\)-cube
- The Magma algebra system. I: The user language
- On the \(p\)-ranks of the adjacency matrices of distance-regular graphs
- Partial permutation decoding for codes from finite planes
- On coverings
- PD-sets for the codes related to some classical varieties
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)
- Permutation Decoding of Systematic Codes
- On the groups of repeated graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item