An Upper Bound on the Size of a Code with the k-Identifiable Parent Property

Research output: Contribution to journal › Article › peer-review

Original language	English
Pages (from-to)	179-185
Number of pages	7
Journal	Journal of Combinatorial Theory, Series A
Volume	102
Publication status	Published - 2003

Cite this

@article{cb934eb0a4fa4135beee643a34551089,

title = "An Upper Bound on the Size of a Code with the k-Identifiable Parent Property",

author = "S.R. Blackburn",

note = "See http://eprint.iacr.org/2002/101",

year = "2003",

language = "English",

volume = "102",

pages = "179--185",

journal = "Journal of Combinatorial Theory, Series A",

issn = "0097-3165",

publisher = "Academic Press Inc.",

}