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

DOI10.1016/S0097-3165(03)00030-XzbMath1020.94026MaRDI QIDQ1873820

Simon R. Blackburn

Publication date: 27 May 2003

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

zbMATH Keywords

upper bound; identifiable parent property; fingerprinting

Mathematics Subject Classification ID

05E99: Algebraic combinatorics

94B65: Bounds on codes

94B25: Combinatorial codes

Related Items

Separating Hash Families: A Johnson-type bound and New Constructions, Equal-Weight Fingerprinting Codes, Upper Bounds for Set Systems with the Identifiable Parent Property, Codes with the identifiable parent property for multimedia fingerprinting, Jack van Lint (1932--2004): a survey of his scientific work, A bound on the size of separating hash families, Upper bounds for parent-identifying set systems, Generalized hashing and parent-identifying codes., New upper bounds for parent-identifying codes and traceability codes, Traceability codes, Multimedia IPP codes with efficient tracing, Wide-sense 2-frameproof codes, On generalized separating hash families, Optimal 2-traceability codes of length 4

Cites Work

• Unnamed Item
• On codes with the identifiable parent property
• A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents
• Combinatorial properties of frameproof and traceability codes
• New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
• Parent-identifying codes