Sciweavers

Share
APPROX   2007 International Workshop on Approximation Algorithms for
Wall of Fame | Most Viewed APPROX-2007 Paper
APPROX
2007
Springer
160views Algorithms» more  APPROX 2007»
8 years 10 months ago
Better Binary List-Decodable Codes Via Multilevel Concatenation
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...
Venkatesan Guruswami, Atri Rudra
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
IdReadViewsTitleStatus
1Download preprint from source160
2Download preprint from source153
3Download preprint from source141
4Download preprint from source137
5Download preprint from source115
6Download preprint from source112
7Download preprint from source112
8Download preprint from source106
9Download preprint from source105
10Download preprint from source104
11Download preprint from source104
12Download preprint from source102
13Download preprint from source102
14Download preprint from source101
15Download preprint from source100
16Download preprint from source99
17Download preprint from source99
18Download preprint from source99
19Download preprint from source97
20Download preprint from source96
21Download preprint from source95
22Download preprint from source92
23Download preprint from source88
24Download preprint from source87
25Download preprint from source86
26Download preprint from source80
27Download preprint from source77
28Download preprint from source76
29Download preprint from source67
30Download preprint from source63
31Download preprint from source60
books