On efficient decoding of alternant codes over a commutative ring

DOI10.1007/3-540-46665-7_19MaRDI QIDQ4945364zbMATH OpenFDO

Authors G. H. Norton, Ana Sălăgean

Publication date 18 March 2002

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

Full work available at URL https://doi.org/10.1007/3-540-46665-7_19

zbMATH Keywords

algorithmsalternant codesBCH codesdecodingerror-locator polynomialminimal realization of a finite sequencerational approximationReed-Solomon codesshortest linear recurrences

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Decoding (94B35)

Recommendations

• On the key equation over a commutative ring
• Alternant and BCH codes over certain rings
• Hamming metric decoding of alternant codes over Galois rings
• Comparison of two algorithms for decoding alternant codes
• scientific article; zbMATH DE number 2154367

Cited in

(13)

• Comparison of two algorithms for decoding alternant codes
• On the key equation over a commutative ring
• A matrix based list decoding algorithm for linear codes over integer residue rings
• On PGZ decoding of alternant codes
• Hamming and Reed-Solomon codes over certain rings
• Decoding a class of alternant codes for the Lee metric
• scientific article; zbMATH DE number 6691894 (Why is no real title available?)
• Generalized Rational Interpolation Over Commutative Rings and Remainder Decoding
• Hamming metric decoding of alternant codes over Galois rings
• scientific article; zbMATH DE number 2154367 (Why is no real title available?)
• Decoding a class of Lee metric codes over a Galois ring
• Alternant and BCH codes over certain rings
• scientific article; zbMATH DE number 5221430 (Why is no real title available?)

This page was built for publication: On efficient decoding of alternant codes over a commutative ring

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