Hulls of codes from incidence matrices of connected regular graphs
From MaRDI portal
Publication:2436579
DOI10.1007/s10623-012-9635-0zbMath1287.05014OpenAlexW2162140163MaRDI QIDQ2436579
T. P. McDonough, Jennifer D. Key, Ghinelli, Dina
Publication date: 25 February 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: http://pure.aber.ac.uk/ws/files/175969/hulls_of_codes_postprint.pdf
Combinatorial aspects of block designs (05B05) Linear codes (general theory) (94B05) Paths and cycles (05C38) Combinatorial codes (94B25)
Related Items
\(LCD\) codes from adjacency matrices of graphs, Codes associated with the odd graphs, The weight distribution of hulls of binary codes from incidence matrices of complete graphs, Ternary codes from some reflexive uniform subset graphs, Hamming graphs and special LCD codes, Linear codes with small hulls in semi-primitive case
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- On the \(p\)-rank of the adjacency matrices of strongly regular graphs
- Permutation decoding for binary codes from lattice graphs
- Codes from incidence matrices and line graphs of Hamming graphs
- Ternary codes from graphs on triples
- The Magma algebra system. I: The user language
- Permutation decoding for the binary codes from triangular graphs.
- 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
- Chromatic number and the 2-rank of a graph
- Codes from incidence matrices of graphs
- Binary codes of strongly regular graphs
- 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
- Information sets and partial permutation decoding for codes from finite geometries
- PD-sets for the codes related to some classical varieties
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)
- Graph theoretic error-correcting codes
- Permutation Decoding of Systematic Codes
