Partial permutation decoding for MacDonald codes

DOI10.1007/s00200-016-0286-7zbMath1353.05027OpenAlexW2301865936MaRDI QIDQ503553

Padmapani Seneviratne, Jennifer D. Key

Publication date: 13 January 2017

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-016-0286-7

zbMATH Keywords

simplex codesMacDonald codesPD-sets

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Linear codes (general theory) (94B05) Decoding (94B35)

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial permutation decoding for simplex codes
• Greedy codes
• The Magma algebra system. I: The user language
• Partial permutation decoding for codes from finite planes
• On coverings
• Information sets and partial permutation decoding for codes from finite geometries
• PD-sets for the codes related to some classical varieties
• On the construction of linear \(q\)-ary lexicodes.
• Design Methods for Maximum Minimum-Distance Error-Correcting Codes
• Minimal permutation sets for decoding the binary Golay codes (Corresp.)
• Maximal<tex>q</tex>-nary linear codes with large minimum distance (Corresp.)
• Permutation Decoding of Systematic Codes