On the Error-Correcting Radius of Folded Reed–Solomon Code Designs
From MaRDI portal
Publication:3460451
DOI10.1007/978-3-319-17296-5_7zbMath1360.94434OpenAlexW2294721679MaRDI QIDQ3460451
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
Related Items (1)
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