Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
20
click to vote
STOC
2010
ACM
favorite
Email
discuss
report
174
views
Algorithms
»
more
STOC 2010
»
Local list-decoding and testing of random linear codes from high error
14 years 1 months ago
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
more »
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)
Researcher Info
Algorithms Study Group
Computer Vision