Codes from the incidence matrices of graphs on 3-sets
From MaRDI portal
Publication:2275405
DOI10.1016/j.disc.2011.04.029zbMath1223.05173OpenAlexW2048336132MaRDI QIDQ2275405
Jennifer D. Key, Eric Mwambene, Washiela Fish
Publication date: 8 August 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.04.029
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial codes (94B25) Graph operations (line graphs, products, etc.) (05C76)
Related Items
Codes associated with the odd graphs, Linear codes and cyclic codes over finite rings and their generalizations: a survey, Binary codes and partial permutation decoding sets from biadjacency matrices of bipartite graphs Γ(2k, k, k + 1, 1), Codes from incidence matrices of graphs, Hulls of codes from incidence matrices of connected regular graphs, Codes and designs from triangular graphs and their line graphs, Binary codes and partial permutation decoding sets from biadjacency matrices of the bipartite graphs \(\Gamma (2k+1,k,k+2,1)\), Codes from incidence matrices of some Bouwer graphs, Codes from incidence matrices of some regular graphs, Codes from incidence matrices of (n, 1)-arrangement graphs and (n, 2)-arrangement graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Codes from lattice and related graphs, and permutation decoding
- Codes associated with triangular graphs and permutation decoding
- Codes and designs from triangular graphs and their line graphs
- Codes from incidence matrices and line graphs of Hamming graphs
- Binary codes from the line graph of the \(n\)-cube
- An empty interval in the spectrum of small weight codewords in the code from points and \(k\)-spaces of \(\mathrm{PG}(n,q)\)
- Ternary codes from graphs on triples
- Hamiltonian uniform subset graphs
- The Magma algebra system. I: The user language
- Partial permutation decoding for codes from finite planes
- Binary codes from graphs on triples
- Codes from incidence matrices of graphs
- Codes from the incidence matrices and line graphs of Hamming graphs \(H^k(n,2)\) for \(k \geq 2\)
- On coverings
- Information sets and partial permutation decoding for codes from finite geometries
- PD-sets for the codes related to some classical varieties
- Constructing Minimal Blocking Sets Using Field Reduction
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)
- Permutation Decoding of Systematic Codes
