Binary codes from graphs on triples

DOI10.1016/j.disc.2003.12.004zbMath1061.94069OpenAlexW2122594181MaRDI QIDQ1827742

Bernardo Gabriel Rodrigues, Jennifer D. Key, Jamshid Moori

Publication date: 6 August 2004

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

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

zbMATH Keywords

CodesDesignsGraphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Combinatorial aspects of block designs (05B05) Combinatorial codes (94B25)

Related Items

\(LCD\) codes from adjacency matrices of graphs ⋮ Codes from adjacency matrices of uniform subset graphs ⋮ Hulls of codes from incidence matrices of connected regular graphs ⋮ Binary codes and partial permutation decoding sets from the Johnson graphs ⋮ Ternary codes from some reflexive uniform subset graphs ⋮ Hamming graphs and special LCD codes ⋮ Codes from the incidence matrices of graphs on 3-sets ⋮ Ternary codes from graphs on triples ⋮ Binary codes from reflexive uniform subset graphs on 3-sets

Uses Software

• Magma

Cites Work

• On the \(p\)-rank of the adjacency matrices of strongly regular graphs
• Permutation decoding for the binary codes from triangular graphs.
• Designs and codes: An update
• Binary codes of strongly regular graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Binary codes from graphs on triples