60 search results - page 2 / 12 » On the Hardness of Decoding the Gale-Berlekamp Code |
FOCS
2003
IEEE
15 years 5 months ago
2003
IEEE
We introduce a unifying framework for proving that predicate P is hard-core for a one-way function f, and apply it to a broad family of functions and predicates, reproving old res...
TIT
2008
14 years 11 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...
87
Voted
ECCC
2006
14 years 11 months ago
2006
We consider the problem of amplifying uniform average-case hardness of languages in NP, where hardness is with respect to BPP algorithms. We introduce the notion of monotone error...
94
Voted
CORR
2008
Springer
14 years 10 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...
76
Voted
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE