Hamming graphs and special LCD codes
From MaRDI portal
Publication:2008071
Recommendations
- \(LCD\) codes from adjacency matrices of graphs
- Special \textit{LCD} codes from products of graphs
- Special LCD codes from Peisert and generalized Peisert graphs
- Codes from the incidence matrices and line graphs of Hamming graphs H^k(n,2) for k 2
- Codes from incidence matrices and line graphs of Hamming graphs
Cites work
- \(LCD\) codes from adjacency matrices of graphs
- All self-complementary symmetric graphs
- Binary codes and partial permutation decoding sets from the Johnson graphs
- Binary codes and partial permutation decoding sets from the odd graphs
- Binary codes from designs from the reflexive n-cube
- Binary codes from graphs on triples
- Binary codes from reflexive uniform subset graphs on 3-sets
- Binary codes of strongly regular graphs
- 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 51878 (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?)
- 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
- Linear codes with complementary duals related to the complement of the Higman-Sims graph
- New bounds for the -k-cut and chromatic number of a graph
- On the p-ranks of the adjacency matrices of distance-regular graphs
- Permutation decoding for binary self-dual codes from the graph Q_n where n is even
- Permutation decoding for the binary codes from triangular graphs.
- Special LCD codes from Peisert and generalized Peisert 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
(8)- \(LCD\) codes from adjacency matrices of graphs
- Special LCD codes from Peisert and generalized Peisert graphs
- Optimal binary and ternary linear codes with hull dimension one
- Hulls of linear codes revisited with applications
- Minimal PD-sets for codes associated with the graphs \(Q^m_2, m\) even
- Special \textit{LCD} codes from products of graphs
- LDPC LCD codes from odd graphs
- Designer of codes: a tribute to Jennifer Key
This page was built for publication: Hamming graphs and special LCD codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2008071)
