Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On tight bounds for binary frameproof codes (1406.6920v1)

Published 26 Jun 2014 in cs.IT, math.CO, and math.IT

Abstract: 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 \geq 3$, and for $w+1 \leq N \leq 3w$, we show that an $SHF(N; n,2, {1,w })$ exists only if $n \leq N$, and an $SHF(N; N,2, {1,w })$ must be a permutation matrix of degree $N$.

Citations (12)

Summary

We haven't generated a summary for this paper yet.