Special \textit{LCD} codes from products of graphs
From MaRDI portal
Publication:6115436
DOI10.1007/s00200-021-00517-4zbMath1518.05117OpenAlexW3175181790MaRDI QIDQ6115436
Washiela Fish, Jennifer D. Key, Eric Mwambene
Publication date: 12 July 2023
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-021-00517-4
Linear codes (general theory) (94B05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph operations (line graphs, products, etc.) (05C76)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved partial permutation decoding for Reed-Muller codes
- Linear codes with complementary duals
- Laplacian matrices of graphs: A survey
- The Magma algebra system. I: The user language
- Permutation decoding for the binary codes from triangular graphs.
- \(LCD\) codes from adjacency matrices of graphs
- Partial permutation decoding for codes from finite planes
- Binary codes of strongly regular 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\)
- Optimal antiblocking systems of information sets for the binary codes related to triangular graphs
- On coverings
- Double circulant LCD codes over \(\mathbb{Z}_4\)
- Information sets and partial permutation decoding for codes from finite geometries
- PD-sets for the codes related to some classical varieties
- Minimal PD-sets for codes associated with the graphs \(Q^m_2, m\) even
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)
- On the Laplacian spectra of product graphs
- Permutation Decoding of Systematic Codes
This page was built for publication: Special \textit{LCD} codes from products of graphs
