P. J. Cameron, Combinatorics: Topics, Techniques, Algorithms, 1996.

S. A. Camtepe and B. Yener, Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks, IEEE/ACM Transactions on Networking, vol.15, issue.2, 2007.
DOI : 10.1109/TNET.2007.892879

N. G. Debruijn, Polya's theory of counting, 1964.

L. Eschenauer and V. D. Gligor, A key-management scheme for distributed sensor networks, Proceedings of the 9th ACM conference on Computer and communications security , CCS '02, pp.41-47, 2002.
DOI : 10.1145/586110.586117

P. Flajolet and R. Sedgewick, Analytic Combinatorics, 2009.
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

P. Flajolet, D. Gardy, and L. Thimonier, Birthday paradox, coupon collectors, caching algorithms and self-organizing search, Discrete Applied Mathematics, vol.39, issue.3, pp.207-2290166, 1992.
DOI : 10.1016/0166-218X(92)90177-C
URL : https://hal.archives-ouvertes.fr/inria-00075832

D. Gardy, Occupancy urn models in the analysis of algorithms, Journal of Statistical Planning and Inference, vol.101, issue.1-2, 1998.
DOI : 10.1016/S0378-3758(01)00156-2

J. Hirschfeld, Projective Geometries over Finite Fields, 1979.

J. J. Rotman, An Introduction to the Theory of Groups, Graduate Texts in Mathematics, vol.148, 1995.
DOI : 10.1007/978-1-4612-4176-8