Two new decoding algorithms for Reed-Solomon codes
Two new decoding algorithms for Reed-Solomon codes are presented, based on the Berlekamp-Welch algorithm. The first one uses the extended Euclidean algorithm and is very efficient for VLSI implementation. The second one is similar to the classical Peterson algorithm but works with remainders rather than with syndromes. The complexity of the algorithms are comparable to the classical ones and as such they may be a viable alternative for decoding Reed-Solomon codes. Pascal-like descriptions are given, and comparisons with different methods are made. Error-and-erasure decoding is not included.
- A New Algorithm for Decoding Reed-Solomon Codes
- scientific article; zbMATH DE number 4008275
- Bounded distance+1 soft-decision Reed-Solomon decoding
- Comparison of the VLSI cost/performance properties of two Reed–Solomon decoding algorithms
- A Decoding Approach to Reed–Solomon Codes from Their Definition
- A method for solving key equation for decoding goppa codes
- A systolic Reed-Solomon encoder
- A VLSI Design of a Pipeline Reed-Solomon Decoder
- Algebraic coding theory
- Bit-serial Reed - Solomon encoders
- Generalized key-equation of remainder decoding algorithm for Reed-Solomon codes
- scientific article; zbMATH DE number 3910296 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3586931 (Why is no real title available?)
- Systolic VLSI Arrays for Polynomial GCD Computation
- New approaches to reduced-complexity decoding
- VLSI architecture of modified Euclidean algorithm for Reed-Solomon code.
- A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes
- Decoding Reed-Solomon codes beyond (d-1)/2 and zeros of multivariate polynomials
- Inversionless decoding of both errors and erasures of Reed-Solomon code
- High-speed decoder of Reed-Solomon codes
- Advances in the performance of Reed-Solomon codes
- On decoding of both errors and erasures of a Reed-Solomon code using an inverse-free Berlekamp-Massey algorithm
- A New Algorithm for Decoding Reed-Solomon Codes
- Power Decoding of Reed–Solomon Codes Revisited
- Using the division algorithm to decode Reed-Solomon codes
- A Simple Algorithm for Decoding Reed–Solomon Codes and its Relation to the Welch–Berlekamp Algorithm
- The software implementation of decoding for RS code based on a new degree computationless modified Euclid (DCME) algorithm
- Simple algorithms for decoding systematic Reed-Solomon codes
- scientific article; zbMATH DE number 3924676 (Why is no real title available?)
- scientific article; zbMATH DE number 4008275 (Why is no real title available?)
- A new Reed-Solomon code decoding algorithm based on Newton's interpolation
- Comparison of the VLSI cost/performance properties of two Reed–Solomon decoding algorithms
- A design of Reed-Solomon decoder with systolic-array structure
- scientific article; zbMATH DE number 1486636 (Why is no real title available?)
- scientific article; zbMATH DE number 1782271 (Why is no real title available?)
- A Decoding Approach to Reed–Solomon Codes from Their Definition
- Self-checking decoding algorithm for Reed-Solomon codes
- Some remarks on an algorithm of Fitzpatrick
- Fast Encoding Algorithms for Reed–Solomon Codes With Between Four and Seven Parity Symbols
- The decoding of extended Reed-Solomon codes
This page was built for publication: Two new decoding algorithms for Reed-Solomon codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1311609)
