Sciweavers

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

9

APPROX
2010
Springer

favoriteEmaildiscussreport

131views Algorithms» more APPROX 2010»

A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field

13 years 6 months ago

A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field

Download www.almaden.ibm.com

David P. Woodruff

Real-time Traffic

Algorithms | APPROX 2010 |

claim paper

Related Content

» Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length

» A FourierAnalytic Approach to ReedMuller Decoding

Post Info
More Details (n/a)

Added	26 Oct 2010
Updated	26 Oct 2010
Type	Conference
Year	2010
Where	APPROX
Authors	David P. Woodruff

Comments (0)