Upper bounds for parent-identifying set systems (Q1009142)

From MaRDI portal

Revision as of 10:03, 1 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Upper bounds for parent-identifying set systems	scientific article

Statements

scholarly article

0 references

Upper bounds for parent-identifying set systems (English)

0 references

zbMATH Open document ID

0 references

10.1007/s10623-008-9253-z

0 references

Michael J. Collins

0 references

Designs, Codes and Cryptography

0 references

publication date

31 March 2009

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10623-008-9253-z

0 references

0 references

New Bounds on Parent-Identifying Codes: The Case of Multiple Parents

0 references

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

0 references

Tracing traitors

0 references

Upper Bounds for Set Systems with the Identifiable Parent Property

0 references

A Note About the Traceability Properties of Linear Codes

0 references

Families of finite sets in which no set is covered by the union of \(r\) others

0 references

Combinatorial properties of frameproof and traceability codes

0 references

Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1009142

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1009142&oldid=35101133"