Binary codes from \(m\)-ary \(n\)-cubes \(Q^m_n\)

DOI10.3934/amc.2020079zbMath1465.94108OpenAlexW3015569734MaRDI QIDQ2025383

Bernardo Gabriel Rodrigues, Jennifer D. Key

Publication date: 12 May 2021

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2020079

zbMATH Keywords

permutation decodingLCD codesLee graph

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Linear codes (general theory) (94B05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

Minimal PD-sets for codes associated with the graphs \(Q^m_2, m\) even, Special \textit{LCD} codes from products of graphs

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved partial permutation decoding for Reed-Muller codes
• Codes from incidence matrices and line graphs of Hamming graphs
• Graphs, designs and codes related to the \(n\)-cube
• Linear codes with complementary duals
• The Magma algebra system. I: The user language
• \(LCD\) codes from adjacency matrices of graphs
• Binary codes and permutation decoding sets from the graph products of cycles
• Partial permutation decoding for codes from finite planes
• Special LCD codes from Peisert and generalized Peisert graphs
• Determinant evaluations for binary circulant matrices
• 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.)
• Lee distance and topological properties of k-ary n-cubes
• Permutation Decoding of Systematic Codes