A new method for decoding Reed-Solomon codes
From MaRDI portal
Recommendations
- Generalized key-equation of remainder decoding algorithm for Reed-Solomon codes
- A New Algorithm for Decoding Reed-Solomon Codes
- Efficient decoding of Reed-Solomon codes beyond half the minimum distance
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Two new decoding algorithms for Reed-Solomon codes
Cited in
(9)- Two new decoding algorithms for Reed-Solomon codes
- The non-gap sequence of a subcode of a generalized Reed-Solomon code
- Cryptanalyzing the polynomial-reconstruction based public-key system under optimal parameter choice
- Decoding of certain classes of Reed-Solomon codes
- Generalized key-equation of remainder decoding algorithm for Reed-Solomon codes
- Self-checking decoding algorithm for Reed-Solomon codes
- Fast parallel algorithms for decoding Reed-Solomon codes based on remainder polynomials
- Some remarks on an algorithm of Fitzpatrick
- Reed-Solomon codes
This page was built for publication: A new method for decoding Reed-Solomon codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3758716)