Constructions and bounds for separating hash families
classification
💻 cs.IT
math.IT
keywords
familieshashseparatingboundssomeconstructionconstructionshypergraphs
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.