On Tight Bounds For Binary Frameproof Codes

Guo Chuan, Stinson Douglas R., Van Trung Tran. Arxiv 2014

[Paper]    
ARXIV

In this paper, we study $w$-frameproof codes, which are equivalent to $\{1,w\}$-separating hash families. Our main results concern binary codes, which are defined over an alphabet of two symbols. For all $w\ge 3$, and for $w+1\le N\le 3w$, we show that an $SHF(N;n,2,\{1,w\})$ exists only if $n\le N$, and an $SHF(N;N,2,\{1,w\})$ must be a permutation matrix of degree $N$.

Similar Work

• Bounds On Codes Based On Graph Theory
• Multi-resolution Hashing For Fast Pairwise Summations
• Uniqueness Of Codes Using Semidefinite Programming
• Asymptotic Improvement Of The Gilbert-varshamov Bound On The Size Of Binary Codes