A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents
From MaRDI portal
Publication:2753534
DOI10.1137/S0895480100376848zbMath1011.94014MaRDI QIDQ2753534
Gilles Zémor, Alexander Barg, Sylvia B. Encheva, Grigory Kabatiansky, Gérard D. Cohen
Publication date: 11 November 2001
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Related Items (22)
An upper bound on the size of a code with the \(k\)-identifiable parent property ⋮ Explicit constructions of separating hash families from algebraic curves over finite fields ⋮ Codes for copyright protection: the case of two pirates ⋮ The parameterized complexity of unique coverage and its variants ⋮ Separation and Witnesses ⋮ Equal-Weight Fingerprinting Codes ⋮ Multimedia IPP codes with efficient tracing ⋮ Detecting arrays for effects of single factors ⋮ Generalization of IPP codes and IPP set systems ⋮ Traceability codes and their generalizations ⋮ On non-binary traceability set systems ⋮ Generalized hashing and parent-identifying codes. ⋮ Wide-sense 2-frameproof codes ⋮ Some intriguing upper bounds for separating hash families ⋮ Codes with the identifiable parent property for multimedia fingerprinting ⋮ A bound on the size of separating hash families ⋮ Binary fingerprinting codes ⋮ New constructions for IPP codes ⋮ Separable collusion-secure multimedia codes ⋮ Intersecting codes and separating codes ⋮ The Budgeted Unique Coverage Problem and Color-Coding ⋮ A class of I.P.P. codes with efficient identification
This page was built for publication: A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents
