35 search results - page 4 / 7 » Subspace Polynomials and List Decoding of Reed-Solomon Codes |
TIT
2008
13 years 7 months ago
2008
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R...
STOC
2012
ACM
11 years 9 months ago
2012
ACM
In this work we describe an explicit, simple, construction of large subsets of Fn , where F is a finite field, that have small intersection with every k-dimensional affine subsp...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
For every 0 < R < 1 and > 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial time up to a fraction (1 - R ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduce the notion of A-covered codes, that is...