A bound on the size of separating hash families

S.R. Blackburn, Tuvi Etzion, Douglas R. Stinson, Gregory M. Zaverucha

Research output: Contribution to journal › Article › peer-review

Original language	English
Pages (from-to)	1246-1256
Number of pages	11
Journal	Journal of Combinatorial Theory, Series A
Volume	115
Issue number	7
Early online date	6 Aug 2007
DOIs	https://doi.org/10.1016/j.jcta.2008.01.009
Publication status	Published - Oct 2008

Access to Document

@article{4e23ceb31c5d4765ab7a58df3228bdbe,

title = "A bound on the size of separating hash families",

author = "S.R. Blackburn and Tuvi Etzion and Stinson, \{Douglas R.\} and Zaverucha, \{Gregory M.\}",

year = "2008",

month = oct,

doi = "10.1016/j.jcta.2008.01.009",

language = "English",

volume = "115",

pages = "1246--1256",

journal = "Journal of Combinatorial Theory, Series A",

issn = "0097-3165",

publisher = "Academic Press Inc.",

number = "7",

}

TY - JOUR

T1 - A bound on the size of separating hash families

AU - Blackburn, S.R.

AU - Etzion, Tuvi

AU - Stinson, Douglas R.

AU - Zaverucha, Gregory M.

PY - 2008/10

Y1 - 2008/10

U2 - 10.1016/j.jcta.2008.01.009

DO - 10.1016/j.jcta.2008.01.009

M3 - Article

SN - 0097-3165

VL - 115

SP - 1246

EP - 1256

JO - Journal of Combinatorial Theory, Series A

JF - Journal of Combinatorial Theory, Series A

IS - 7

ER -