35 search results - page 2 / 7 » Subspace Polynomials and List Decoding of Reed-Solomon Codes |
JSAC
2006
13 years 5 months ago
2006
In this paper, we present an iterative soft-decision decoding algorithm for Reed
CORR
2007
Springer
13 years 5 months ago
2007
Springer
Title of dissertation: PERFORMANCE ANALYSIS OF ALGEBRAIC SOFT-DECISION DECODING OF REED-SOLOMON CODES Andrew Duggan, Masters of Science, 2006 Thesis directed by: Professor Alexand...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
TIT
2008
13 years 5 months ago
2008
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
In this paper we propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speed up of the decoding process of BCH, Reed-S...