On Fractional Decoding of Reed-Solomon Codes
classification
💻 cs.IT
math.IT
keywords
decodingreed-solomonalgorithmcodefractionalalphabeyondbound
read the original abstract
We define a virtual projection of a Reed-Solomon code $RS(q^{l},n,k)$ to an $RS(q,n,k)$ Reed-Solomon code. A new probabilistic decoding algorithm that can be used to perform fractional decoding beyond the $\alpha$- decoding radius is considered. An upper bound for the failure probability of the new algorithm is given, and the performance is illustrated by examples.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.