Folded codes from function field towers and improved optimal rate list decoding
We give a new construction of algebraic codes which are efficiently list decodable from a fraction 1-R-ε of adversarial errors where R is the rate of the code, for any desired positive constant ε. The worst-case list size output by the algorithm is O(1/ε), matching the existential bound for random c...
| Hlavní autoři: | , |
|---|---|
| Další autoři: | |
| Médium: | Conference Paper |
| Jazyk: | English |
| Vydáno: |
2013
|
| On-line přístup: | https://hdl.handle.net/10356/99006 http://hdl.handle.net/10220/12643 |