On the Error-Correcting Radius of Folded Reed–Solomon Code Designs

DOI10.1007/978-3-319-17296-5_7zbMath1360.94434OpenAlexW2294721679MaRDI QIDQ3460451

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)

Related Items (1)

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

Cites Work

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

This page was built for publication: On the Error-Correcting Radius of Folded Reed–Solomon Code Designs