Apr 10, 2019 · A new probabilistic decoding algorithm that can be used to perform fractional decoding beyond the α- decoding radius is considered.
A new probabilistic decoding algorithm that can be used to perform fractional decoding beyond the α- decoding radius is considered. An upper bound for the ...
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 ...
A new probabilistic decoding algorithm that can be used to perform fractional decoding beyond the α- decoding radius is considered. An upper bound for ...
People also ask
What is Reed-Solomon code decoder?
What is the Reed-Solomon code implementation?
What is Reed Solomon error correction simplified?
Why the Reed-Solomon code is an optimal Erasure code?
A new probabilistic decoding algorithm that can be used to perform fractional decoding beyond the α- decoding radius is considered and an upper bound for ...
In this paper, we present a fractional decoding algorithm for a new family of codes which are constructed from the Hermitian curve, called r-Hermitian codes ...
On Fractional Decoding of Reed-Solomon Codes. Work. HTML. Year: 2019. Type: preprint. Source: arXiv (Cornell University). Author Welington Santos.
The procedure presented makes use of fractional decoding of Reed-Solomon codes while allowing for the use of codes of similar lengths over smaller fields.
For Reed-Solomon codes, we showed that one can efficiently list decode up to a radius (fraction of errors) equal to 1 − √ R. However we know that list ...
The task of reconstructing polynomials describing a given set of points is relevant in the context of coding theory and we describe this context next. This task ...