LCD codes from adjacency matrices of graphs
DOI10.1007/S00200-017-0339-6zbMATH Open1391.94846OpenAlexW2748466041MaRDI QIDQ1647744FDOQ1647744
Authors: J. D. Key, B. G. Rodrigues 
Publication date: 26 June 2018
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-017-0339-6
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Association schemes, strongly regular graphs (05E30) Linear codes (general theory) (94B05) Combinatorial codes (94B25)
Cites Work
- The Magma algebra system. I: The user language
- Linear codes with complementary duals
- Title not available (Why is that?)
- Association schemes and coding theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the \(p\)-rank of the adjacency matrices of strongly regular graphs
- Binary codes of strongly regular graphs
- Permutation decoding for the binary codes from triangular graphs.
- Binary codes from graphs on triples
- Codes from the incidence matrices and line graphs of Hamming graphs \(H^k(n,2)\) for \(k \geq 2\)
- Permutation decoding of codes from generalized Paley graphs
- Codes from incidence matrices and line graphs of Hamming graphs
- Hulls of codes from incidence matrices of connected regular graphs
- Codes from adjacency matrices of uniform subset graphs
- On the spectra of Johnson graphs
- Title not available (Why is that?)
- Graphs, designs and codes related to the \(n\)-cube
- Codes, designs and groups from the Hamming graphs
- Ternary codes from graphs on triples
- Ternary codes from some reflexive uniform subset graphs
- Binary codes and partial permutation decoding sets from the odd graphs
- Binary codes from reflexive uniform subset graphs on 3-sets
- Codes from neighbourhood designs of the graphs \(\text{GP}(q,\frac{q-1}{2})\) with \(q\) odd
- Linear codes with complementary duals from some strongly regular subgraphs of the McLaughlin graph
- On the spectrum of the Johnson graphs \(J(n,k,r)\)
Cited In (12)
- Special LCD codes from Peisert and generalized Peisert graphs
- LCD codes arising from wavelets
- Hamming graphs and special LCD codes
- Graph theoretic aspects of minimum distance and equivalence of binary linear codes
- Binary and ternary LCD codes from projective spaces
- Codes from adjacency matrices of uniform subset graphs
- Binary codes from \(m\)-ary \(n\)-cubes \(Q^m_n\)
- Isodual and self-dual codes from graphs
- Another generalisation of the binary Reed-Muller codes and its applications
- Construction of linear codes from the unit graph \(G(\mathbb{Z}_n)\)
- Special \textit{LCD} codes from products of graphs
- LDPC codes constructed from cubic symmetric graphs
Uses Software
This page was built for publication: \(LCD\) codes from adjacency matrices of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1647744)
