Abstract

For a set C of words of length 4 over an alphabet of size n, and for a, bC, let D(a, b) be the set of all descendants of a and b, that is, all words x of length 4 where x_i{a_i, b_i} for all 1i4. The code C satisfies the Identifiable Parent Property if for any descendant of two code-words one can identify at least one parent. The study of such codes is motivated by questions about schemes that protect against piracy of software. Here we show that for any >0, if the alphabet size is n>n₀() then the maximum possible cardinality of such a code is less than n² and yet it is bigger than n²⁻. This answers a question of Hollmann, van Lint, Linnartz, and Tolhuizen. The proofs combine graph theoretic tools with techniques in additive number theory.