On Fractional Decoding of Reed-Solomon Codes
Abstract
We define a virtual projection of a Reed-Solomon code RS(ql,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 α- decoding radius is considered. An upper bound for the failure probability of the new algorithm is given, and the performance is illustrated by examples.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.