Codes with the Identifiable Parent Property for Multimedia Fingerprinting
Minquan Cheng, Hung-Lin Fu, Jing Jiang, Yuan-Hsun Lo, Ying Miao

TL;DR
This paper introduces multimedia IPP codes for fingerprinting, providing bounds and constructions for codes that can identify at least one parent codeword from descendant codes, with a focus on length 2 codes.
Contribution
It defines multimedia IPP codes, derives bounds on their size, and constructs optimal codes for length 2, advancing multimedia fingerprinting techniques.
Findings
Derived a general upper bound on code size M.
Characterized length 2 multimedia 3-IPP codes via bipartite graphs.
Constructed infinite families of asymptotically optimal codes.
Abstract
Let be a -ary code of length and size , and be the set of th coordinates of . The descendant code of a sub-code is defined to be . In this paper, we introduce a multimedia analogue of codes with the identifiable parent property (IPP), called multimedia IPP codes or -MIPPC, so that given the descendant code of any sub-code of a multimedia -IPP code , one can always identify, as IPP codes do in the generic digital scenario, at least one codeword in . We first derive a general upper bound on the size of a multimedia -IPP code, and then investigate multimedia -IPP codes in more…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
