Efficient decoding of Reed-Solomon codes beyond half the minimum distance
From MaRDI portal
Publication:4503508
DOI10.1109/18.817522zbMath1001.94046OpenAlexW2122685617MaRDI QIDQ4503508
Ron M. Roth, Gitit Ruckenstein
Publication date: 7 September 2000
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/2580365fbc54a2c0475aa3fa34e3b8648dde81fa
Related Items (17)
Computing minimal interpolation bases ⋮ Proofs of Work from worst-case assumptions ⋮ A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes ⋮ Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes ⋮ High-speed \(\mathrm{RS}(255, 239)\) decoder based on LCC decoding ⋮ Algorithms for simultaneous Hermite-Padé approximations ⋮ Polynomial root finding over local rings and application to error correcting codes ⋮ Interpolation in list decoding of Reed-Solomon codes ⋮ A Syndrome Formulation of the Interpolation Step in the Guruswami-Sudan Algorithm ⋮ LIST DECODING OF THE BIORTHOGONAL WAVELET CODE WITH PREDETERMINED CODE DISTANCE ON A FIELD OF ODD CHARACTERISTIC ⋮ Row reduction applied to decoding of rank-metric and subspace codes ⋮ Key equations for list decoding of Reed-Solomon codes and how to solve them ⋮ Power decoding Reed-Solomon codes up to the Johnson radius ⋮ On 2-dimensional insertion-deletion Reed-Solomon codes with optimal asymptotic error-correcting capability ⋮ Algorithm for calculating the roots of polynomials with coefficients in the ring of polynomials over an arbitrary integral domain ⋮ Scalable secure storage when half the system is faulty ⋮ Gröbner basis solutions of constrained interpolation problems
This page was built for publication: Efficient decoding of Reed-Solomon codes beyond half the minimum distance
