F. Edward, J. D. Assmus, and . Key, Designs and Their Codes, 1992.

D. Augot, F. Levy-dit-vehel, and A. Shikfa, A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers, Cryptology and Network Security -13th International Conference Proceedings, volume 8813 of Lecture Notes in Computer Science, pp.222-239, 2014.
DOI : 10.1007/978-3-319-12280-9_15
URL : https://hal.archives-ouvertes.fr/hal-01094807

A. Beimel, Y. Ishai, E. Kushilevitz, and J. Raymond, Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., pp.261-270, 2002.
DOI : 10.1109/SFCS.2002.1181949

A. Beimel, Y. Ishai, and T. Malkin, Reducing the Servers? Computation in Private Information Retrieval: PIR with Preprocessing, Journal of Cryptology, vol.17, issue.2, pp.125-151, 2004.
DOI : 10.1007/s00145-004-0134-y

B. Chor and N. Gilboa, Computationally private information retrieval, Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, pp.304-313, 1997.
DOI : 10.1145/258533.258609
URL : http://www.wisdom.weizmann.ac.il/~oded/PS/pir2.ps

B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan, Private information retrieval, 36th Annual Symposium on Foundations of Computer Science, pp.23-25, 1995.

B. Chor, E. Kushilevitz, O. Goldreich, and M. Sudan, Private information retrieval, Journal of the ACM, vol.45, issue.6, pp.965-981, 1998.
DOI : 10.1145/293347.293350

J. Charles, J. H. Colbourn, and . Dinitz, Handbook of Combinatorial Designs, Second Edition, 2006.

Z. Dvir and S. Gopi, 2-Server PIR with Subpolynomial Communication, Journal of the ACM, vol.63, issue.4, pp.1-3915, 2016.
DOI : 10.1561/0400000030

K. Efremenko, 3-Query Locally Decodable Codes of Subexponential Length, SIAM Journal on Computing, vol.41, issue.6, pp.1694-1703, 2012.
DOI : 10.1137/090772721
URL : http://www.cs.tau.ac.il/%7Eklim/papers/LDC_new.pdf

A. Fazeli, A. Vardy, and E. Yaakobi, Codes for distributed PIR with low storage overhead, 2015 IEEE International Symposium on Information Theory (ISIT), pp.2852-2856, 2015.
DOI : 10.1109/ISIT.2015.7282977

N. Hamada, The rank of the incidence matrix of points and d-flats in finite geometries, Journal of Science of the Hiroshima University, Series A-I (Mathematics), vol.32, issue.2, pp.381-396, 1968.

J. Katz and L. Trevisan, On the efficiency of local decoding procedures for errorcorrecting codes, Proceedings of the Thirty- Second Annual ACM Symposium on Theory of Computing, pp.80-86, 2000.

S. Kopparty, S. Saraf, and S. Yekhanin, High-rate codes with sublinear-time decoding, J. ACM, vol.6128, issue.5, pp.1-2820, 2014.
DOI : 10.1145/1993636.1993660
URL : http://research.microsoft.com/en-us/um/people/yekhanin/Papers/highratelocal.pdf

R. Douglas and . Stinson, Combinatorial Designs -Constructions and Analysis, 2004.

S. Yekhanin, Towards 3-query locally decodable codes of subexponential length, J. ACM, vol.551, issue.1, pp.1-1, 2008.
DOI : 10.1145/1326554.1326555
URL : http://www.di.ens.fr/~vergnaud/algo0910/Locally.pdf

S. Yekhanin, Locally Decodable Codes, Foundations and Trends?? in Theoretical Computer Science, vol.6, issue.3, pp.139-255, 2012.
DOI : 10.1561/0400000030