On optimal codes with \(w\)-identifiable parent property
From MaRDI portal
Publication:2384057
DOI10.1007/s10623-007-9083-4zbMath1203.68130MaRDI QIDQ2384057
Publication date: 20 September 2007
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-007-9083-4
90C47: Minimax problems in mathematical programming
68R10: Graph theory (including graph drawing) in computer science
90C27: Combinatorial optimization
68P25: Data encryption (aspects in computer science)
94B25: Combinatorial codes
Cites Work
- Unnamed Item
- On codes with \(w\)-identifiable parent property
- On codes with the identifiable parent property
- Combinatorial properties of frameproof and traceability codes
- New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
- On the Maximal Codes of Length 3 with the 2-Identifiable Parent Property
- Collusion-secure fingerprinting for digital data