Decoding Folded Reed–Solomon Codes Using Hensel-Lifting

DOI10.1007/978-3-540-93806-4_26MaRDI QIDQ3652834zbMATH OpenOpenAlexFDO

Authors Peter Beelen, Kristian Brander

Publication date 16 December 2009

Published in Gröbner Bases, Coding, and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-93806-4_26

Mathematics Subject Classification ID

Decoding (94B35)

Recommendations

• The decoding of extended Reed-Solomon codes
• Lifted Reed-Solomon Codes and Lifted Multiplicity Codes
• A Decoding Approach to Reed–Solomon Codes from Their Definition
• Decoding Reed–Solomon Skew-Differential Codes
• A Hensel lifting to replace factorization in list-decoding of algebraic-geometric and Reed-Solomon codes
• scientific article; zbMATH DE number 57521
• Decoding of Reed Solomon codes beyond the error-correction bound
• On the complexity of decoding Reed-Solomon codes (Corresp.)
• The fast decoding of Reed-Solomon codes using Fermat transforms (Corresp.)
• Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes

Cited in

(3)

• A Hensel lifting to replace factorization in list-decoding of algebraic-geometric and Reed-Solomon codes
• On the error-correcting radius of folded Reed-Solomon code designs
• Folded codes from function field towers and improved optimal rate list decoding

This page was built for publication: Decoding Folded Reed–Solomon Codes Using Hensel-Lifting

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