On the error-correcting radius of folded Reed-Solomon code designs

DOI10.1007/978-3-319-17296-5_7MaRDI QIDQ3460451zbMATH OpenOpenAlexFDO

Authors Joschi Brauchle

Publication date 7 January 2016

Published in Coding Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-17296-5_7

zbMATH Keywords

multivariate interpolationdecoding radiusParvaresh-Vardy codeslow-order folded Reed-Solomon codes

Mathematics Subject Classification ID

Decoding (94B35)

Recommendations

• Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
• Explicit capacity-achieving list-decodable codes
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Algebraic decoding of folded Gabidulin codes
• Decoding Folded Reed–Solomon Codes Using Hensel-Lifting

Cites work

• Decoding of Reed Solomon codes beyond the error-correction bound
• Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
• Highly resilient correctors for polynomials
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes
• Pseudorandomness
• Upper Bounds on the Number of Errors Corrected by a Convolutional Code

Cited in

(1)

• Interpolation-based decoding of folded variants of linearized and skew Reed-Solomon codes

This page was built for publication: On the error-correcting radius of folded Reed-Solomon code designs

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