Binary Codes for Collusion-Secure Fingerprinting
ICISC '01 Proceedings of the 4th International Conference Seoul on Information Security and Cryptology
An upper bound on the size of a code with the k-identifiable parent property
Journal of Combinatorial Theory Series A
Intersecting codes and separating codes
Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
Generalized hashing and parent-identifying codes
Journal of Combinatorial Theory Series A
The Lovász Local Lemma and Its Applications to some Combinatorial Arrays
Designs, Codes and Cryptography
A class of I.P.P. codes with efficient identification
Journal of Complexity - Special issue on coding and cryptography
New Constructions for IPP Codes
Designs, Codes and Cryptography
Designs, Codes and Cryptography
Codes for Copyright Protection: The Case of Two Pirates
Problems of Information Transmission
Explicit constructions of separating hash families from algebraic curves over finite fields
Designs, Codes and Cryptography
Guessing secrets efficiently via list decoding
ACM Transactions on Algorithms (TALG)
A bound on the size of separating hash families
Journal of Combinatorial Theory Series A
IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
Equal-Weight Fingerprinting Codes
IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
The Budgeted Unique Coverage Problem and Color-Coding
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Copyright control and separating systems
AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Digital fingerprinting under and (somewhat) beyond the marking assumption
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Traitor tracing against powerful attacks using combinatorial designs
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
| Hi-index | 0.00 |
Let C be a code of length n over an alphabet of q letters. An n-word y is called a descendant of a set of t codewords x1, . . . ,xt if $y_i\in\{x^1_i,\dots,x^t_i\}$ for all i=1, . . . ,n. A code is said to have the t-identifying parent property if for any n-word that is a descendant of at most t parents it is possible to identify at least one of them. We prove that for any $t\le q-1$ there exist sequences of such codes with asymptotically nonvanishing rate.