2014/06/26 by Chuan Guo, Douglas R. Stinson, Guo, Chuan +3
Computer Science · Engineering · Mathematics · #Algorithms and Data Compression #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #cs.IT #graph theory and CDMA systems #math.CO #math.IT
paper · pdf · doi:10.48550/arxiv.1406.6920
arxiv created 2014/06/26 · openalex publication_date 2014/06/26 · arxiv updated 2014/06/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 ≥ 3, and for w+1 ≤ N ≤ 3w, we show that an SHF(N; n,2, \1,w \) exists only if n ≤ N, and an SHF(N; N,2, \1,w \) must be a permutation matrix of degree N.