A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes
From MaRDI portal
Publication:1675777
DOI10.1016/j.ipl.2010.08.009zbMath1380.94150OpenAlexW2054213115MaRDI QIDQ1675777
Publication date: 3 November 2017
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.08.009
Cites Work
- Unnamed Item
- Unnamed Item
- Decoding of Reed Solomon codes beyond the error-correction bound
- Error-correcting codes for list decoding
- A New Algorithm for Decoding Reed-Solomon Codes
- Algebraic soft-decision decoding of reed-solomon codes
- New List Decoding Algorithms for Reed–Solomon and BCH Codes
- Performance Analysis of Algebraic Soft-Decision Decoding of Reed–Solomon Codes
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Efficient decoding of Reed-Solomon codes beyond half the minimum distance
- Fast generalized minimum-distance decoding of algebraic-geometry and Reed-Solomon codes
- Shift-register synthesis and BCH decoding
This page was built for publication: A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes