Improved Bounds on the Size of Separating Hash Families of Short Length: Penying Rochanakul

Support Team

Improved Bounds on the Size of Separating Hash Families of Short Length

Penying Rochanakul

Authors

Support Team

Keywords:

separating hash families, frameproof codes

Abstract

In this paper, we present some new upper bounds on the size of separating hash families of type {w1,w2} of short length, where the length N is not exceeding 2w2. A new proof for tight bounds on the size of separating hash families of type {1, w} is also given.

Downloads

Published

2020-03-01

How to Cite

Team, S. (2020). Improved Bounds on the Size of Separating Hash Families of Short Length: Penying Rochanakul. Thai Journal of Mathematics, 401–412. Retrieved from https://thaijmath2.in.cmu.ac.th/index.php/thaijmath/article/view/979