Codes from adjacency matrices of uniform subset graphs

DOI10.1007/s00373-017-1862-8zbMath1390.05128OpenAlexW2774085593MaRDI QIDQ1706431

Jennifer D. Key, Eric Mwambene, Washiela Fish

Publication date: 22 March 2018

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10566/3314

zbMATH Keywords

uniform subset graphscodes from graphs

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

\(LCD\) codes from adjacency matrices of graphs ⋮ A characterization of graphs by codes from their incidence matrices ⋮ Dominating sets for uniform subset graphs

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Binary codes and partial permutation decoding sets from the Johnson graphs
• Ternary codes from graphs on triples
• Linear codes with complementary duals
• The Magma algebra system. I: The user language
• On the \(p\)-ranks of the adjacency matrices of distance-regular graphs
• \(LCD\) codes from adjacency matrices of graphs
• Binary codes from graphs on triples
• Binary codes and partial permutation decoding sets from the odd graphs
• Ternary codes from some reflexive uniform subset graphs
• Binary codes from reflexive uniform subset graphs on 3-sets
• On the spectra of Johnson graphs
• Association schemes and coding theory