Voir la notice de l'article provenant de la source Math-Net.Ru
@article{PDM_2009_4_a3, author = {A. V. Cheremushkin}, title = {A recursive algorithm for cover-free family construction}, journal = {Prikladna\^a diskretna\^a matematika}, pages = {51--55}, publisher = {mathdoc}, number = {4}, year = {2009}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/PDM_2009_4_a3/} }
A. V. Cheremushkin. A recursive algorithm for cover-free family construction. Prikladnaâ diskretnaâ matematika, no. 4 (2009), pp. 51-55. http://geodesic.mathdoc.fr/item/PDM_2009_4_a3/
[1] Stinson D. R., van Trung T., Wei R., “Secure frameproof codes, key distribution patterns, group testing algorithms and related structures”, J. Statist. Plan. Infer., 86:2 (2000), 595–617 | DOI | MR | Zbl
[2] Atici M., Magliveras M. M., Stinson D. R., Wei W.-D., “Some recursive constructions for perfect hash families”, J. Combinat. Designs, 44 (1996), 353–363 | 3.0.CO;2-E class='badge bg-secondary rounded-pill ref-badge extid-badge'>DOI | MR
[3] Beth T., Jungnickel D., Lenz H., Design theory, Cambridge Univ. Press, 1989, 688 pp. | MR
[4] Cheremushkin A. V., “Kombinatorno-geometricheskie podkhody k postroeniyu skhem predvaritelnogo raspredeleniya klyuchei (obzor publikatsii)”, Prikladnaya diskretnaya matematika, 2008, no. 1(1), 55–63
[5] Mitchell C. J., Piper C., “Key storage in Secure Networks”, Discr. Appl. Math., 21 (1988), 215–228 | DOI | MR | Zbl