Constructions of \(t\)-strongly multimedia IPP codes with length \(t+1\)
From MaRDI portal
Publication:6618621
DOI10.1007/s10623-024-01422-wMaRDI QIDQ6618621
Minquan Cheng, Fenggui Pei, Cailin Wen, Henk D. L. Hollmann, Jing Jiang
Publication date: 14 October 2024
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Combinatorics in computer science (68R05) Cryptography (94A60) Other types of codes (94B60) Combinatorial codes (94B25) Internet topics (68M11) Designs and configurations (05B99)
Cites Work
- Strongly separable codes
- Codes with the identifiable parent property for multimedia fingerprinting
- On codes with the identifiable parent property
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
- New upper bounds for parent-identifying codes and traceability codes
- New constructions for IPP codes
- A class of I.P.P. codes with efficient identification
- An upper bound on the size of a code with the \(k\)-identifiable parent property
- Multimedia IPP codes with efficient tracing
- A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents
- Combinatorial properties of frameproof and traceability codes
- Digital fingerprinting codes: problem statements, constructions, identification of traitors
- Collusion-secure fingerprinting for digital data
- Separable Codes
- On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting
This page was built for publication: Constructions of \(t\)-strongly multimedia IPP codes with length \(t+1\)