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

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s10623-008-9253-z / 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
Property / DOI
 
Property / DOI: 10.1007/S10623-008-9253-Z / rank
 
Normal rank

Latest revision as of 12:37, 10 December 2024