Binary codes from the line graph of the \(n\)-cube
From MaRDI portal
Publication:975825
DOI10.1016/j.jsc.2010.03.012zbMath1191.94125OpenAlexW1991323656MaRDI QIDQ975825
Washiela Fish, Eric Mwambene, Jennifer D. Key
Publication date: 11 June 2010
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2010.03.012
Related Items
Codes from lattice and related graphs, and permutation decoding, Codes associated with the odd graphs, Minimal PD-sets for codes associated with the graphs \(Q^m_2, m\) even, Codes from incidence matrices and line graphs of Hamming graphs, Codes from the incidence matrices of graphs on 3-sets, Graphs, designs and codes related to the \(n\)-cube, Codes from incidence matrices of some regular graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Binary codes from rectangular lattice graphs and permutation decoding
- Permutation decoding for binary codes from lattice graphs
- Graphs, designs and codes related to the \(n\)-cube
- The Magma algebra system. I: The user language
- The rank of a cograph
- Partial permutation decoding for codes from finite planes
- On coverings
- Codes associated with circulant graphs and permutation decoding
- Information sets and partial permutation decoding for codes from finite geometries
- PD-sets for the codes related to some classical varieties
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)
- Congruent Graphs and the Connectivity of Graphs
- Permutation Decoding of Systematic Codes