Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures

In this paper, we study upper bounds on the minimum length of frameproof codes introduced by Boneh and Shaw to protect copyrighted materials. A q-ary (k,n)-frameproof code of length t is a t \times n matrix having entries in \{0,1,\ldots, q-1\} and with the property that for any column \mathbf{c}... Show more