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
26
click to vote
STOC
2003
ACM
favorite
Email
discuss
report
135
views
Algorithms
»
more
STOC 2003
»
Linear time encodable and list decodable codes
14 years 11 months ago
Download
www.cs.washington.edu
Venkatesan Guruswami, Piotr Indyk
Real-time Traffic
Algorithms
|
Linear Time
|
STOC 2003
|
claim paper
Related Content
»
Approaching BlokhZyablov Error Exponent with LinearTime EncodableDecodable Codes
»
Lineartime encodable and decodable errorcorrecting codes
»
ListDecoding Using The XOR Lemma
»
On Representations of AlgebraicGeometric Codes for List Decoding
»
Linear Time Erasure Codes with Nearly Optimal Recovery Extended Abstract
»
Linear time decoding of realfield codes over high error rate channels
»
SIMDbased decoding of posting lists
»
Better Binary ListDecodable Codes Via Multilevel Concatenation
»
Local ListDecoding and Testing of Random Linear Codes from HighError
more »
Post Info
More Details (n/a)
Added
03 Dec 2009
Updated
03 Dec 2009
Type
Conference
Year
2003
Where
STOC
Authors
Venkatesan Guruswami, Piotr Indyk
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision