Minimal PD-sets for codes associated with the graphs \(Q^m_2, m\) even

DOI10.1007/s00200-020-00481-5OpenAlexW3119348823MaRDI QIDQ2682394

Bernardo Gabriel Rodrigues, Jennifer D. Key

Publication date: 31 January 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-020-00481-5

zbMATH Keywords

permutation decodingLCD codesLee graphs

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

Special \textit{LCD} codes from products of graphs

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial permutation decoding for simplex codes
• Improved partial permutation decoding for Reed-Muller codes
• Binary codes from the line graph of the \(n\)-cube
• Graphs, designs and codes related to the \(n\)-cube
• The Magma algebra system. I: The user language
• Binary codes and permutation decoding sets from the graph products of cycles
• Partial permutation decoding for codes from finite planes
• Hamming graphs and special LCD codes
• Binary codes from \(m\)-ary \(n\)-cubes \(Q^m_n\)
• On coverings
• PD-sets for the codes related to some classical varieties
• Minimal permutation sets for decoding the binary Golay codes (Corresp.)
• Permutation Decoding of Systematic Codes