Upper bounds for parent-identifying set systems

Authors:
Michael J. Collins
Affiliations:
Sandia National Laboratories, Albuquerque, USA 87185
Venue:
Designs, Codes and Cryptography
Year:
2009

Citing 6
Cited 0

Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes

SIAM Journal on Discrete Mathematics
An upper bound on the size of a code with the k-identifiable parent property

Journal of Combinatorial Theory Series A
New Bounds on Parent-Identifying Codes: The Case of Multiple Parents

Combinatorics, Probability and Computing
A note about the traceability properties of linear codes

ICISC'07 Proceedings of the 10th international conference on Information security and cryptology
Tracing traitors

IEEE Transactions on Information Theory
Combinatorial properties of frameproof and traceability codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We derive new upper bounds on the size set families having the c-identifiable parent property (c-IPP) and the c-traceability property (c-TA) and compare these bounds to similar results on parent-identifying codes.