Sciweavers

110 search results - page 6 / 22
» Locally Decodable Quantum Codes
Sort
View
ECCC
2010
153views more  ECCC 2010»
13 years 4 months ago
Local list decoding with a constant number of queries
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
STOC
2005
ACM
198views Algorithms» more  STOC 2005»
14 years 9 months ago
On lattices, learning with errors, random linear codes, and cryptography
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
Oded Regev