Codes associated with the odd graphs

DOI10.1016/j.disc.2013.10.015zbMath1278.05042OpenAlexW2019218177MaRDI QIDQ393176

Jennifer D. Key, Washiela Fish, Eric Mwambene

Publication date: 16 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.10.015

zbMATH Keywords

Fano planePetersen graphcodespermutation decodingodd graphs

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Linear codes (general theory) (94B05) Graph operations (line graphs, products, etc.) (05C76)

Related Items

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
• Partial permutation decoding for simplex codes
• A characterization of graphs by codes from their incidence matrices
• Codes from incidence matrices and line graphs of Paley graphs
• Codes from lattice and related graphs, and permutation decoding
• Codes associated with triangular graphs and permutation decoding
• Codes from incidence matrices and line graphs of Hamming graphs
• Binary codes from the line graph of the \(n\)-cube
• Minimum words of codes from affine planes
• On defect-d matchings in graphs
• The Magma algebra system. I: The user language
• Partial permutation decoding for codes from finite planes
• Chromatic number and the 2-rank of a graph
• Codes from incidence matrices of graphs
• Minimum weight and dimension formulas for some geometric codes
• Codes from the incidence matrices of graphs on 3-sets
• Codes from the incidence matrices and line graphs of Hamming graphs \(H^k(n,2)\) for \(k \geq 2\)
• On coverings
• Hulls of codes from incidence matrices of connected regular graphs
• PD-sets for binary RM-codes and the codes related to the Klein quadric and to the Schubert variety of \(\mathrm{PG}(5,2)\)
• Information sets and partial permutation decoding for codes from finite geometries
• PD-sets for the codes related to some classical varieties
• Codes from the line graphs of complete multipartite graphs and PD-sets
• Minimal permutation sets for decoding the binary Golay codes (Corresp.)
• Permutation Decoding of Systematic Codes