Dense quantum coding and quantum finite automata, Journal of the ACM, vol.49, issue.4, pp.496-511, 2002. ,
DOI : 10.1145/581771.581773
Checking computations in polylogarithmic time, Proceedings of the twenty-third annual ACM symposium on Theory of computing , STOC '91, pp.21-31, 1991. ,
DOI : 10.1145/103418.103428
Private information retrieval 3-Query Locally Decodable Codes of Subexponential Length A guided tour of Chernoff bounds, J. of ACM Information Processing Letters, vol.45, issue.66, pp.965-981, 1990. ,
On the efficiency of local decoding procedures for error-correcting codes, Proceedings of the thirty-second annual ACM symposium on Theory of computing , STOC '00, pp.80-86, 2000. ,
DOI : 10.1145/335305.335315
Exponential lower bound for 2-query locally decodable codes via a quantum argument, Proc. of 40th IEEE FOCSTre04] L. Trevisan. Some applications of coding theory in computational complexity. Quaderni di Matematica Probabilistic computations: Toward a unified measure of complexity Proc. of 18th IEEE FOCS Proc. of 39th ACM STOC, pp.395-420, 1977. ,
DOI : 10.1016/j.jcss.2004.04.007