|
|||||
|
|
Constructions of 2‐cover‐free families and related separating hash families |
|
| Authors: | P. C. Li G. H. J. van Rees R. Wei |
| Abstract: | Cover‐free families (CFFs) were considered from different subjects by numerous researchers. In this article, we mainly consider explicit constructions of (2; d)‐cover‐free families. We also determine the size of optimal 2‐cover‐free‐families on 9, 10, and 11 points. Related separating hash families, which can be used to construct CFFs, are also discussed. © 2006 Wiley Periodicals, Inc. J Combin Designs 14: 423–440, 2006 |
| Keywords: | cover‐free family separating hash families superimposed codes combinatorial design cryptography |