Efficient constructions of frameproof codes

Abstract

If C is a code of length n over a p-ary alphabet, then x is called a descendant of the codewords a, b, ..., e if xi ∈ {ai, bi, ..., ei} for i = 1, ..., n. The authors study codes with the following property: the descendant of any coalition of codewords of a given maximal size does not belong to C.