Constructions and bounds for separating hash families
Information Theory
2017-09-19 v2 math.IT
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.
Cite
@article{arxiv.1611.03274,
title = {Constructions and bounds for separating hash families},
author = {X. Niu and H. Cao},
journal= {arXiv preprint arXiv:1611.03274},
year = {2017}
}
Comments
Hash family, separating hash family, strong separating hash family, hypergraph