An upper bound on the size of a code with the k-identifiable parent property
Journal of Combinatorial Theory Series A
On optimal codes with w-identifiable parent property
Designs, Codes and Cryptography
On generalized separating hash families
Journal of Combinatorial Theory Series A
A bound on the size of separating hash families
Journal of Combinatorial Theory Series A
Upper Bounds for Set Systems with the Identifiable Parent Property
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Upper bounds for parent-identifying set systems
Designs, Codes and Cryptography
Journal of Combinatorial Theory Series A
Digital fingerprinting under and (somewhat) beyond the marking assumption
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
| Hi-index | 0.03 |
Let $C$ be a code of length $n$ over an alphabet of $q$ letters. A codeword $y$ is called a descendant of a set of $t$ codewords $\{x^1,\dots,x^t\}$ if $y_i \in \{x^1_i,\dots,x^t_i\}$ for all $i=1,\dots,n$. A code is said to have the Identifiable Parent Property of order $t$ if, for any word of length $n$ that is a descendant of at most $t$ codewords (parents), it is possible to identify at least one of them. Let $f_t(n,q)$ be the maximum possible cardinality of such a code. We prove that for any $t,n,q$, $(c_1(t)q)^{\frac{n}{s(t)}}