Upper bounds for parent-identifying set systems
type: Item
instance of: scholarly article
title: Upper bounds for parent-identifying set systems
zbMATH Open document ID: 1236.05050
author: Michael J. Collins
published in: Designs, Codes and Cryptography
publication date: 2009-03-31T00:00:00Z
Mathematics Subject Classification ID: 05B25
zbMATH DE Number: 5536830
MaRDI profile type: Publication
full work available at URL: s10623-008-9253-z
OpenAlex ID: W2069023101
cites work: New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
cites work: An upper bound on the size of a code with the \(k\)-identifiable parent property
cites work: Tracing traitors
cites work: Upper Bounds for Set Systems with the Identifiable Parent Property
cites work: A Note About the Traceability Properties of Linear Codes
cites work: Families of finite sets in which no set is covered by the union of \(r\) others
cites work: Combinatorial properties of frameproof and traceability codes
cites work: Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
DOI: 10.1007/S10623-008-9253-Z
Recommended article: Upper Bounds for Set Systems with the Identifiable Parent Property
Recommended article: Improved upper bounds for parent-identifying set systems and separable codes
Recommended article: Constructive upper bounds for intersecting set systems
Recommended article: On 2-parent-identifying set systems of block size 4
Recommended article: On separating systems with bounded set size
Recommended article: Extremal \(n\)-systems of sets
Recommended article: Upper and lower bounds on $B_k^+$-sets
Recommended article: Probabilistic Existence Results for Parent-Identifying Schemes
Recommended article: Determination of set-membership identifiability sets
Recommended article: An Upper Bound on the Size of Sidon Sets
description: scientific article; zbMATH DE number 5536830