5 search results - page 1 / 1 » Improvement of Ashikhmin-Litsyn-Tsfasman bound for quantum c... |
56
Voted
TIT
2002
14 years 9 months ago
2002
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding nbit strings over an ℓ-bit alphabet, where the decode...
EUROCRYPT
2005
Springer
15 years 3 months ago
2005
Springer
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...
TIT
2002
14 years 9 months ago
2002
We extend a low-rate improvement of the random coding bound on the reliability of a classical discrete memoryless channel (DMC) to its quantum counterpart. The key observation that...
ASIACRYPT
2009
Springer
15 years 4 months ago
2009
Springer
Code-based cryptography is often viewed as an interesting “Post-Quantum” alternative to the classical number theory cryptography. Unlike many other such alternatives, it has th...