| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656137 | Journal of Combinatorial Theory, Series A | 2011 | 7 Pages |
Abstract
This paper aims to present new upper bounds on the size of separating hash families. These bounds improve previously known bounds for separating hash families.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
