Talk Abstract: Codes with the Identifiable Parent Property

Institute for Mathematics and Its Applications

Talk abstract:

Codes with the Identifiable Parent Property

Jack van Lint, Eindhoven University of Technology

If C is a q-ary code of length n and a and b are two codewords, then c is called a descendant of a and b if
c_i $\in$ { a_i,b_i } for i=1,2, $\dots$ ,n. We are interested in codes C with the property that, given any descendant c, one can always identify at least one of the ``parent'' codewords in C. We study bounds on F(n,q), the maximal cardinality of a code C with this property, which we call the identifiable parent property.

Multimedia publishers can ``fingerprint'' images by changing perceptually insignificant aspects in order to be able to trace violation of copyright restrictions. Our codes have the property that if the codewords are used as fingerprints and two users create a new image by combining parts of their images, then the new image reveals the identity of at least one of the source images.

Typical results of this paper are of the type

$3q-12 \sqrt q\leq F(n,q)\leq 3q-1$

and

$\F(n,q)\geq c\left( \frac q4 \right)^{\frac n3}$ .

Back to Workshop Schedule