Upper bounds for parent-identifying set systems (Q1009142): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10623-008-9253-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069023101 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Bounds on Parent-Identifying Codes: The Case of Multiple Parents / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the size of a code with the \(k\)-identifiable parent property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tracing traitors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper Bounds for Set Systems with the Identifiable Parent Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note About the Traceability Properties of Linear Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of finite sets in which no set is covered by the union of \(r\) others / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial properties of frameproof and traceability codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes / rank
 
Normal rank

Latest revision as of 10:03, 1 July 2024