{"paper":{"title":"Codes with the Identifiable Parent Property for Multimedia Fingerprinting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hung-Lin Fu, Jing Jiang, Minquan Cheng, Ying Miao, Yuan-Hsun Lo","submitted_at":"2014-11-25T09:35:11Z","abstract_excerpt":"Let ${\\cal C}$ be a $q$-ary code of length $n$ and size $M$, and ${\\cal C}(i) = \\{{\\bf c}(i) \\ | \\ {\\bf c}=({\\bf c}(1), {\\bf c}(2), \\ldots, {\\bf c}(n))^{T} \\in {\\cal C}\\}$ be the set of $i$th coordinates of ${\\cal C}$. The descendant code of a sub-code ${\\cal C}^{'} \\subseteq {\\cal C}$ is defined to be ${\\cal C}^{'}(1) \\times {\\cal C}^{'}(2) \\times \\cdots \\times {\\cal C}^{'}(n)$. In this paper, we introduce a multimedia analogue of codes with the identifiable parent property (IPP), called multimedia IPP codes or $t$-MIPPC$(n, M, q)$, so that given the descendant code of any sub-code ${\\cal C}^"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6784","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}