Graphs, designs and codes related to the \(n\)-cube

DOI10.1016/j.disc.2008.09.024zbMath1228.05072MaRDI QIDQ1025949

Jennifer D. Key, Washiela Fish, Eric Mwambene

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

zbMATH Keywords

graph; design; code; permutation decoding

Mathematics Subject Classification ID

05B05: Combinatorial aspects of block designs

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

94B25: Combinatorial codes

Related Items

Codes from incidence matrices and line graphs of Hamming graphs, Binary codes from the line graph of the \(n\)-cube, Codes from neighbourhood designs of the graphs \(\text{GP}(q,\frac{q-1}{2})\) with \(q\) odd

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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