1008 search results - page 2 / 202 » Better extractors for better codes |
ICSM
2009
IEEE
14 years 3 months ago
2009
IEEE
Nowadays, programmers spend much of their workday dealing with code libraries and frameworks that are bloated with APIs. One common way of interacting with APIs is through Code Co...
APPROX
2007
Springer
14 years 2 months ago
2007
Springer
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
DCC
2010
IEEE
13 years 3 months ago
2010
IEEE
Abstract. Given an algebraic geometry code CL(D, P), the GuruswamiSudan algorithm produces a list of all codewords in CL(D, P) within a specified distance of a received word. The i...
INFOCOM
2012
IEEE
11 years 11 months ago
2012
IEEE
—We study error estimating codes with the goal of establishing better bounds for the theoretical and empirical overhead of such schemes. We explore the idea of using sketch data ...
APPROX
2005
Springer
14 years 2 months ago
2005
Springer
Optimal dispersers have better dependence on the error than optimal extractors. In this paper we give explicit disperser constructions that beat the best possible extractors in so...