Upper Bounds for Set Systems with the Identifiable Parent Property

DOI10.1007/978-3-540-85093-9_10MaRDI QIDQ5502795zbMATH OpenOpenAlexFDO

Authors Michael J. Collins

Publication date 9 January 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85093-9_10

Mathematics Subject Classification ID

Cryptography (94A60) Combinatorial codes (94B25)

Cites work

• An upper bound on the size of a code with the \(k\)-identifiable parent property
• Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
• Families of finite sets in which no set is covered by the union of \(r\) others
• New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
• Tracing traitors

Cited in

(1)

• Upper bounds for parent-identifying set systems

This page was built for publication: Upper Bounds for Set Systems with the Identifiable Parent Property

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5502795)