Title of article
Bounds for separating hash families
Author/Authors
Bazrafshan، نويسنده , , Marjan and van Trung، نويسنده , , Tran، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
7
From page
1129
To page
1135
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.
Keywords
Separating hash family , w-IPP code , Frameproof code , perfect hash family
Journal title
Journal of Combinatorial Theory Series A
Serial Year
2011
Journal title
Journal of Combinatorial Theory Series A
Record number
1531625
Link To Document