A recursive algorithm for cover-free family construction
Prikladnaâ diskretnaâ matematika, no. 4 (2009), pp. 51-55

Voir la notice de l'article provenant de la source Math-Net.Ru

A new recursive algorithm based on orthogonal arrays is proposed for cover-free family construction. The algorithm modifies the one suggested by Stinson D. R., van Trung T., and Wei R. As a consequence we obtain the method for recursive construction of collusion-resistant key distribution schemes.
Keywords: cover-free family, key distribution scheme.
@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/}
}
TY  - JOUR
AU  - A. V. Cheremushkin
TI  - A recursive algorithm for cover-free family construction
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2009
SP  - 51
EP  - 55
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2009_4_a3/
LA  - ru
ID  - PDM_2009_4_a3
ER  - 
%0 Journal Article
%A A. V. Cheremushkin
%T A recursive algorithm for cover-free family construction
%J Prikladnaâ diskretnaâ matematika
%D 2009
%P 51-55
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2009_4_a3/
%G ru
%F 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/