Binary codes from reflexive uniform subset graphs on 3-sets
From MaRDI portal
Publication:2346712
DOI10.3934/amc.2015.9.211zbMath1314.05109OpenAlexW2401069202MaRDI QIDQ2346712
Jennifer D. Key, Eric Mwambene, Washiela Fish
Publication date: 3 June 2015
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2015.9.211
Combinatorial aspects of block designs (05B05) Linear codes (general theory) (94B05) Eulerian and Hamiltonian graphs (05C45)
Related Items
\(LCD\) codes from adjacency matrices of graphs, On some codes from rank 3 primitive actions of the simple Chevalley group \(G_2(q) \), Dominating sets for uniform subset graphs, Codes from adjacency matrices of uniform subset graphs, Ternary codes from some reflexive uniform subset graphs, Hamming graphs and special LCD codes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A characterization of graphs by codes from their incidence matrices
- Ternary codes from graphs on triples
- The Magma algebra system. I: The user language
- Directed \(t\)-packings and directed \(t\)-Steiner systems
- On the \(p\)-ranks of the adjacency matrices of distance-regular graphs
- Partial permutation decoding for codes from finite planes
- Binary codes from graphs on triples
- Codes from incidence matrices of graphs
- Ternary codes from some reflexive uniform subset graphs
- 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