Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > FOLDED REED-SOLOMON CODE:
Reports tagged with Folded Reed-Solomon Code:
TR07-109 | 7th October 2007
Venkatesan Guruswami, Atri Rudra

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 over fixed alphabets
that can be list decoded in polynomial time up to the so called
Blokh-Zyablov bound. Our work ... more >>>




ISSN 1433-8092 | Imprint