C. J. Mitchell and F. C. Piper, Key storage in secure networks, Discrete Applied Mathematics, vol.21, issue.3, pp.215-228, 1988.
DOI : 10.1016/0166-218X(88)90068-6

A. D. Friedman, R. L. Graham, and J. D. Ullman, Universal single transition time asynchronous state assignments, IEEE Trans. Comput, vol.18, issue.6, pp.541-547, 1969.

G. Mago, Monotone Functions in Sequential Circuits, IEEE Transactions on Computers, vol.22, issue.10, pp.928-933, 1973.
DOI : 10.1109/T-C.1973.223620

Y. L. Sagalovich, Separating systems, Problems of Information Transmission, vol.30, issue.2, pp.105-123, 1994.

G. D. Cohen and H. G. Schaathun, Asymptotic overview on separating codes, 2003.

K. Engel, Interval Packing and Covering in the Boolean Lattice, Combinatorics, Probability and Computing, vol.3, issue.04, pp.373-384, 1996.
DOI : 10.1007/BF01788531

D. 'yachkov, A. G. Vilenkin, P. A. Macula, A. J. Torney, and D. C. , Families of Finite Sets in which No Intersection of ??? Sets Is Covered by the Union of s Others, Journal of Combinatorial Theory, Series A, vol.99, issue.2, pp.195-218, 2002.
DOI : 10.1006/jcta.2002.3257

D. 'yachkov, A. G. Vilenkin, P. A. Macula, A. J. Torney, D. C. Yekhanin et al., New Results in the Theory of Superimposed Codes, Proc. Seventh Int. Workshop on Algebraic and Combinatorial Coding Theory, pp.126-136, 2000.

D. 'yachkov, A. G. Rykov, V. V. Deppe, C. Lebedev, and V. S. , Superimposed Codes and Threshold Group Testing, Information Theory, Combinatorics, and Search Theory, pp.509-533, 2013.

V. S. Lebedev, Asymptotic Upper Bound for the Rate of (w, r) Cover-Free Codes, Problems of Information Transmission, vol.39, issue.4, pp.317-323, 2003.
DOI : 10.1023/B:PRIT.0000011270.09033.8f

D. 'yachkov, A. G. Vorobyev, I. V. Polyanskii, N. A. Shchukin, and V. Yu, Bounds on the Rate of Disjunctive Codes, Problems of Information Transmission, vol.50, issue.1, pp.27-56, 2014.

D. 'yachkov, A. G. Vorobyev, I. V. Polyanskii, N. A. Shchukin, and V. Yu, Bounds on the Rate of Superimposed Codes, 2014 IEEE International Symposium on Information Theory, pp.2341-2345, 2014.

Y. L. Sagalovich, Completely Separating Systems, Probl. Peredachi Inf, vol.18, issue.2, pp.74-82, 1982.

G. Cohen and G. Zemor, Intersecting codes and independent families, IEEE Transactions on Information Theory, vol.40, issue.6, pp.1872-1881, 1994.
DOI : 10.1109/18.340462

D. Boneh and J. Shaw, Collusion-secure fingerprinting for digital data, IEEE Transactions on Information Theory, vol.44, issue.5, p.1897, 1905.
DOI : 10.1109/18.705568

J. N. Staddon, D. R. Stinson, and R. Wei, Combinatorial properties of frameproof and traceability codes, IEEE Transactions on Information Theory, vol.47, issue.3, pp.1042-1049, 2001.
DOI : 10.1109/18.915661