|
Organizers |
Construction of efficient maximum identifiable parent property codes of length 3
by
Wen Jiang
School of Mathematics, Georgia Institute of Technology
Coauthors: Xingxing Yu, Ye (Geoffrey) Li and Bolian Liu
In order to provide copyright protection for digital materials, a distributor embeds different watermarks (i.e., codewords) into different products before sending them to customers. The watermark in each product can be used to identify the customer who buys that product; thereby, redistributing the product is equivalent to exposing the customer's identity. However, a group of customers can collude and compare their products to detect their watermarks, and then create a new product with a pirate watermark. Codes with identifiable parent property (IPP) can rovide means of traceability in presence of a collusion attack, and trace the source of an unauthorized distribution.Many results have been obtained on codes with IPP, including constructions and bounds on sizes. In this paper, we obtain a precise formula for the maximum size of IPP codes of length 3 by means of nonlinear programming and provide simple constructions of maximum size IPP codes of length 3. From our construction procedures, we show these codes allow for efficient tracing.
Date received: September 15, 2005
Copyright © 2005 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caqt-75.