Hamming and Reed-Solomon codes over certain rings

zbMATH Open1134.94385MaRDI QIDQ2383441FDOQ2383441

Authors: A. A. Andrade, Reginaldo jun. Palazzo 

Publication date: 19 September 2007

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Recommendations

• On the decoding of Reed-Solomon and BCH codes over integer residue rings
• Construction and decoding of BCH codes over finite commutative rings
• Goppa and Srivastava codes over finite rings
• Alternant and BCH codes over certain rings
• Publication:4945364

zbMATH Keywords

Reed-Solomon codeHamming codemodified Berlekamp-Massey algorithmForney's methoderror-location numbersyndrome calculation

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Arithmetic codes (94B40)

Cited In (4)

• Binary Reed-Muller codes and Hamming spheres
• On the key equation over a commutative ring
• On the Hamming distance of linear codes over a finite chain ring
• Hamming metric decoding of alternant codes over Galois rings

This page was built for publication: Hamming and Reed-Solomon codes over certain rings

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