论文信息 - Upper bounds for parent-identifying set systems

Upper bounds for parent-identifying set systems

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.

Michael J. Collins

[1] Jessica Staddon,et al. Combinatorial properties of frameproof and traceability codes , 2001, IEEE Trans. Inf. Theory.

[2] Simon R. Blackburn,et al. An upper bound on the size of a code with the k-identifiable parent property , 2003, J. Comb. Theory, Ser. A.

[3] Amos Fiat,et al. Tracing Traitors , 1994, CRYPTO.

[4] Noga Alon,et al. New Bounds on Parent-Identifying Codes: The Case of Multiple Parents , 2004, Combinatorics, Probability and Computing.

[5] Douglas R. Stinson,et al. Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes , 1998, SIAM J. Discret. Math..

[6] P. Erdös,et al. Families of finite sets in which no set is covered by the union ofr others , 1985 .

[7] Miguel Soriano,et al. A Note About the Traceability Properties of Linear Codes , 2007, ICISC.

[8] Michael J. Collins. Upper Bounds for Set Systems with the Identifiable Parent Property , 2008, ICITS.