Power Decoding of Reed–Solomon Codes Revisited
From MaRDI portal
Abstract: Power decoding, or "decoding by virtual interleaving", of Reed--Solomon codes is a method for unique decoding beyond half the minimum distance. We give a new variant of the Power decoding scheme, building upon the key equation of Gao. We show various interesting properties such as behavioural equivalence to the classical scheme using syndromes, as well as a new bound on the failure probability when the powering degree is 3.
Recommendations
- Power decoding Reed-Solomon codes up to the Johnson radius
- Decoding of Reed Solomon codes beyond the error-correction bound
- On the complexity of decoding Reed-Solomon codes (Corresp.)
- The decoding of extended Reed-Solomon codes
- On the decoder error probability for Reed - Solomon codes (Corresp.)
- Bit-level soft-decision decoding of Reed-Solomon codes
- A Decoding Approach to Reed–Solomon Codes from Their Definition
- Efficient decoding of Reed-Solomon codes beyond half the minimum distance
- Complexity of Decoding Positive-Rate Reed-Solomon Codes
- Two new decoding algorithms for Reed-Solomon codes
Cites work
- A New Algorithm for Decoding Reed-Solomon Codes
- Decoding of Reed Solomon codes beyond the error-correction bound
- Fast skew-feedback shift-register synthesis
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- Introduction to Coding Theory
- Syndrome Decoding of Reed–Solomon Codes Beyond Half the Minimum Distance Based on Shift-Register Synthesis
Cited in
(3)
This page was built for publication: Power Decoding of Reed–Solomon Codes Revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3460479)