Constructions and bounds for separating hash families

2016/11/10 by Niu, X., Cao, H.
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1611.03274

Abstract

In this paper, we present a new construction for strong separating hash families by using hypergraphs and obtain some optimal separating hash families. We also improve some previously known bounds of separating hash families.

Related

• Perfect and separating Hash families: new bounds via the algorithmic\n cluster expansion local lemma
• A tight bound on the size of certain separating hash families
• Separating hash families: A Johnson-type bound and new constructions
• The Improvement of the Bound on Hash Family
• Some intriguing upper bounds for separating hash families