Permutation decoding using primitive elements as multipliers

DOI10.1007/3-540-57936-2_45MaRDI QIDQ4382328zbMATH OpenFDO

Authors Tho Le-Ngoc, Ming Jia, Anader Benyamin-Seeyar

Publication date 10 January 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57936-2_45

zbMATH Keywords

cyclic codespermutation decodingprimitive elements

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cyclic codes (94B15) Decoding (94B35)

Recommendations

• Permutation Decoding of Systematic Codes
• Permutation decoding for codes from designs, finite geometries and graphs
• Partial permutation decoding for binary linear Hadamard codes
• Decoding mixed errors and erasures in permutation codes
• Permutation decoding of abelian codes

Cited in

(1)

• Permutation Decoding of Systematic Codes

This page was built for publication: Permutation decoding using primitive elements as multipliers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4382328)