Sciweavers

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

9

STOC
2010
ACM

favoriteEmaildiscussreport

174views Algorithms» more STOC 2010»

Local list-decoding and testing of random linear codes from high error

13 years 9 months ago

Local list-decoding and testing of random linear codes from high error

Download web.mit.edu

Swastik Kopparty, Shubhangi Saraf

Real-time Traffic

STOC 2010 |

claim paper

Related Content

» Local ListDecoding and Testing of Random Linear Codes from HighError

» Limits to List Decoding Random Codes

» The existence of concatenated codes listdecodable up to the hamming bound

» Some Recent Results on Local Testing of Sparse Linear Codes

» Robust Local Testability of Tensor Products of LDPC Codes

» Dense locally testable codes cannot have constant rate and distance

» Robust locally testable codes and products of codes

» Locally Testable Codes Require Redundant Testers

» Efficient Highly OverComplete Sparse Coding using a Mixture Model

Post Info
More Details (n/a)

Added	18 Jul 2010
Updated	18 Jul 2010
Type	Conference
Year	2010
Where	STOC
Authors	Swastik Kopparty, Shubhangi Saraf

Comments (0)