LCD codes from adjacency matrices of graphs

DOI10.1007/S00200-017-0339-6MaRDI QIDQ1647744zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

\(LCD\) codesstrongly regular graphsuniform subset graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Association schemes, strongly regular graphs (05E30) Linear codes (general theory) (94B05) Combinatorial codes (94B25)

Recommendations

• Special \textit{LCD} codes from products of graphs
• Hamming graphs and special LCD codes
• Special LCD codes from Peisert and generalized Peisert graphs
• LCD codes from weighing matrices
• The combinatorics of LCD codes: linear programming bound and orthogonal matrices

Cites work

• Association schemes and coding theory
• Binary codes and partial permutation decoding sets from the odd graphs
• Binary codes from graphs on triples
• Binary codes from reflexive uniform subset graphs on 3-sets
• Binary codes of strongly regular graphs
• Codes from adjacency matrices of uniform subset graphs
• Codes from incidence matrices and line graphs of Hamming graphs
• Codes from neighbourhood designs of the graphs \(\text{GP}(q,\frac{q-1}{2})\) with \(q\) odd
• Codes from the incidence matrices and line graphs of Hamming graphs H^k(n,2) for k 2
• Codes, designs and groups from the Hamming graphs
• Graphs, designs and codes related to the n-cube
• scientific article; zbMATH DE number 50655 (Why is no real title available?)
• scientific article; zbMATH DE number 53917 (Why is no real title available?)
• scientific article; zbMATH DE number 1284430 (Why is no real title available?)
• scientific article; zbMATH DE number 863484 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• Hulls of codes from incidence matrices of connected regular graphs
• Linear codes with complementary duals
• Linear codes with complementary duals from some strongly regular subgraphs of the McLaughlin graph
• On the \(p\)-rank of the adjacency matrices of strongly regular graphs
• On the spectra of Johnson graphs
• On the spectrum of the Johnson graphs \(J(n,k,r)\)
• Permutation decoding for the binary codes from triangular graphs.
• Permutation decoding of codes from generalized Paley graphs
• Ternary codes from graphs on triples
• Ternary codes from some reflexive uniform subset graphs
• The Magma algebra system. I: The user language

Cited in

(16)

• Another generalisation of the binary Reed-Muller codes and its applications
• Codes from adjacency matrices of uniform subset graphs
• Special LCD codes from Peisert and generalized Peisert graphs
• Hamming graphs and special LCD codes
• Binary codes from \(m\)-ary \(n\)-cubes \(Q^m_n\)
• LDPC codes constructed from cubic symmetric graphs
• Binary and ternary LCD codes from projective spaces
• Graph theoretic aspects of minimum distance and equivalence of binary linear codes
• Isodual and self-dual codes from graphs
• LCD codes from equitable partitions of association schemes
• Special \textit{LCD} codes from products of graphs
• LCD codes arising from wavelets
• Construction of linear codes from the unit graph \(G(\mathbb{Z}_n)\)
• LDPC codes from Deza graphs
• LCD codes over finite fields
• Designer of codes: a tribute to Jennifer Key

Describes a project that uses

Uses Software

• Magma

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)