160 search results - page 1 / 32 » On the List-Decodability of Random Linear Codes |
STOC
2010
ACM
14 years 2 months ago
2010
ACM
STOC
2010
ACM
14 years 2 months ago
2010
ACM
COCOON
2009
Springer
14 years 1 days ago
2009
Springer
It has been known since [Zyablov and Pinsker 1982] that a random q-ary code of rate 1 − Hq(ρ) − ε (where 0 < ρ < 1 − 1/q, ε > 0 and Hq(·) is the q-ary entropy ...
APPROX
2007
Springer
13 years 11 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...
STOC
2003
ACM
14 years 5 months ago
2003
ACM