An upper bound on the size of a code with the k-identifiable parent property

Authors:
Simon R. Blackburn
Affiliations:
Department of Mathematics, Royal Holloway, University of London, Egham, Surrey TW20 0EX, UK
Venue:
Journal of Combinatorial Theory Series A
Year:
2003

Citing 6
Cited 9

On codes with the identifiable parent property

Journal of Combinatorial Theory Series A
Parent-identifying codes

Journal of Combinatorial Theory Series A
A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents

SIAM Journal on Discrete Mathematics
Tracing Traitors

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
New Bounds on Parent-Identifying Codes: The Case of Multiple Parents

Combinatorics, Probability and Computing
Combinatorial properties of frameproof and traceability codes

IEEE Transactions on Information Theory

Generalized hashing and parent-identifying codes

Journal of Combinatorial Theory Series A
Jack van Lint (1932-2004): a survey of his scientific work

Journal of Combinatorial Theory Series A - Special issue in honor of Jacobus H. van Lint
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
Equal-Weight Fingerprinting Codes

IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
Traceability codes

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper gives an upper bound on the size of a q-ary code of length n that has the k-identifiable parent property. One consequence of this bound is that the optimal rate of such a code is determined in many cases when q → ∞ with k and n fixed.