Efficient decoding of Reed-Solomon codes beyond half the minimum distance
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1461545
- scientific article; zbMATH DE number 1594297
- Decoding of Reed Solomon codes beyond the error-correction bound
- scientific article; zbMATH DE number 1047549
- scientific article; zbMATH DE number 702920
- scientific article; zbMATH DE number 57521
- The decoding of extended Reed-Solomon codes
- On the complexity of decoding Reed-Solomon codes (Corresp.)
- Complete decoding of doubly-extended Reed-Solomon codes of minimum distance 5 and 6
- Fast generalized minimum-distance decoding of algebraic-geometry and Reed-Solomon codes
Cited in
(35)- Algorithm for calculating the roots of polynomials with coefficients in the ring of polynomials over an arbitrary integral domain
- Quasioptimal methods of correlational reception of Reed-Solomon codes
- Decoding of Reed Solomon codes beyond the error-correction bound
- Gröbner basis solutions of constrained interpolation problems
- Proofs of Work from worst-case assumptions
- A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes
- Power decoding Reed-Solomon codes up to the Johnson radius
- Scalable secure storage when half the system is faulty
- Decoding Reed-Solomon codes beyond (d-1)/2 and zeros of multivariate polynomials
- On 2-dimensional insertion-deletion Reed-Solomon codes with optimal asymptotic error-correcting capability
- Algorithms for simultaneous Hermite-Padé approximations
- Polynomial root finding over local rings and application to error correcting codes
- Computing minimal interpolation bases
- Exploiting the cannibalistic traits of Reed-Solomon codes
- Advances in the performance of Reed-Solomon codes
- Power Decoding of Reed–Solomon Codes Revisited
- A Syndrome Formulation of the Interpolation Step in the Guruswami-Sudan Algorithm
- New List Decoding Algorithms for Reed–Solomon and BCH Codes
- From the Euclidean algorithm for solving a key equation for dual Reed-Solomon codes to the Berlekamp-Massey algorithm
- scientific article; zbMATH DE number 3924676 (Why is no real title available?)
- scientific article; zbMATH DE number 4008275 (Why is no real title available?)
- Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes
- scientific article; zbMATH DE number 67092 (Why is no real title available?)
- High-speed \(\mathrm{RS}(255, 239)\) decoder based on LCC decoding
- scientific article; zbMATH DE number 503203 (Why is no real title available?)
- scientific article; zbMATH DE number 702920 (Why is no real title available?)
- scientific article; zbMATH DE number 1047549 (Why is no real title available?)
- scientific article; zbMATH DE number 1461545 (Why is no real title available?)
- Row reduction applied to decoding of rank-metric and subspace codes
- List decoding of the biorthogonal wavelet code with predetermined code distance on a field of odd characteristic
- On the List and Bounded Distance Decodability of Reed–Solomon Codes
- Coding and Cryptography
- The decoding of extended Reed-Solomon codes
- Interpolation in list decoding of Reed-Solomon codes
- Key equations for list decoding of Reed-Solomon codes and how to solve them
This page was built for publication: Efficient decoding of Reed-Solomon codes beyond half the minimum distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4503508)
