Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

106

STOC
2010
ACM

178views Algorithms» more STOC 2010»

On the List-Decodability of Random Linear Codes

15 years 12 months ago

On the List-Decodability of Random Linear Codes

Download eccc.hpi-web.de

Venkatesan Guruswami, Johan Håstad and Swastik Ko

Real-time Traffic

Algorithms | Random Linear Codes | STOC 2010 |

claim paper

Related Content

» Local ListDecoding and Testing of Random Linear Codes from HighError

» Limits to List Decoding Random Codes

» Better Binary ListDecodable Codes Via Multilevel Concatenation

» Linear time encodable and list decodable codes

» List Decoding of Biorthogonal Codes and the Hadamard Transform With Linear Complexity

» Combinatorial bounds for list decoding

» List decoding for nested lattices and applications to relay channels

» A NeymanPearson Approach to Universal Erasure and List Decoding

» List decoding tensor products and interleaved codes

Post Info
More Details (n/a)

Added	01 Mar 2010
Updated	02 Mar 2010
Type	Conference
Year	2010
Where	STOC
Authors	Venkatesan Guruswami, Johan Håstad and Swastik Koppart

Comments (0)