J. Katz and L. Trevisan, 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

S. Yekhanin, Locally Decodable Codes, ser. Foundations and Trends in Theoretical Computer Science. NOW publisher, 2012.
DOI : 10.1007/978-3-642-20712-9_22
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.6772

S. Kopparty, S. Saraf, and S. Yekhanin, High-rate Codes with Sublineartime decoding, Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing, pp.167-176, 2011.

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, pp.222-239, 2014.
DOI : 10.1007/978-3-319-12280-9_15
URL : https://hal.archives-ouvertes.fr/hal-01094807

S. Kopparty, List-decoding multiplicity codes, Electronic Colloquium on Computational Complexity (ECCC), pp.12-044, 2012.

T. Kasami, S. Lin, and W. Peterson, New generalizations of the Reed-Muller codes--I: Primitive codes, IEEE Transactions on Information Theory, vol.14, issue.2, pp.189-199, 1968.
DOI : 10.1109/TIT.1968.1054127

J. Key, T. Mcdonough, and V. Mavron, Information sets and partial permutation decoding for codes from finite geometries, Finite Fields and Their Applications, pp.232-247, 2006.
DOI : 10.1016/j.ffa.2005.05.007

R. P. Stanley, Enumerative Combinatorics, ser. Cambridge Studies in Advanced Mathematics, 2011.

V. Guruswami and C. Wang, Linear-algebraic list decoding for variants of Reed?Solomon codes Information Theory, IEEE Transactions on, vol.59, issue.6, pp.3257-3268, 2013.