Sciweavers

93 search results - page 5 / 19

» Query-Efficient Locally Decodable Codes

93

FOCS
2007
IEEE

100views Theoretical Computer Science» more FOCS 2007»

Sparse Random Linear Codes are Locally Decodable and Testable

15 years 9 months ago

Sparse Random Linear Codes are Locally Decodable and Testable

Download people.csail.mit.edu

Tali Kaufman, Madhu Sudan

claim paper

Read More »

99

APPROX
2010
Springer

131views Algorithms» more APPROX 2010»

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

15 years 4 months ago

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

Download www.almaden.ibm.com

David P. Woodruff

claim paper

Read More »

103

STOC
2003
ACM

118views Algorithms» more STOC 2003»

Exponential lower bound for 2-query locally decodable codes via a quantum argument

16 years 3 months ago

Exponential lower bound for 2-query locally decodable codes via a quantum argument

Download homepages.cwi.nl

Iordanis Kerenidis, Ronald de Wolf

claim paper

Read More »

96

Voted

ECCC
2007

127views more ECCC 2007»

Public Key Encryption Which is Simultaneously a Locally-Decodable Error-Correcting Code

15 years 2 months ago

Public Key Encryption Which is Simultaneously a Locally-Decodable Error-Correcting Code

Download www-personal.umich.edu

Brett Hemenway, Rafail Ostrovsky

claim paper

Read More »

167

ECCC
2010

153views more ECCC 2010»

Local list decoding with a constant number of queries

14 years 9 months ago

Local list decoding with a constant number of queries

Download www.cs.tau.ac.il

Efremenko showed locally-decodable codes of sub-exponential length that can handle close to 1 6 fraction of errors. In this paper we show that the same codes can be locally unique...

Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma

claim paper

Read More »

« Prev « First page 5 / 19 Last » Next »