English

On Fractional Decoding of Reed-Solomon Codes

Information Theory 2019-04-12 v1 math.IT

Abstract

We define a virtual projection of a Reed-Solomon code RS(ql,n,k)RS(q^{l},n,k) to an RS(q,n,k)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.

Keywords

Cite

@article{arxiv.1904.05400,
  title  = {On Fractional Decoding of Reed-Solomon Codes},
  author = {Welington Santos},
  journal= {arXiv preprint arXiv:1904.05400},
  year   = {2019}
}
R2 v1 2026-06-23T08:35:58.703Z