35 search results - page 1 / 7 » Subspace Polynomials and List Decoding of Reed-Solomon Codes |
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
— The list decoding algorithm can outperform the conventional unique decoding algorithm by producing a list of candidate decoded messages. An efficient list decoding algorithm fo...
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
ASAP
2005
IEEE
13 years 6 months ago
2005
IEEE
Reed-Solomon codes are an important class of error correcting codes used in many applications related to communications and digital storage. The fundamental operations in Reed-Sol...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
In this paper, we prove the following two results that expose some combinatorial limitations to list decoding ReedSolomon codes.