An Upper Bound on the Size of a Code with the k-Identifiable Parent Property. / Blackburn, S.R.

In: Journal of Combinatorial Theory, Series A, Vol. 102, 2003, p. 179-185.

Research output: Contribution to journalArticlepeer-review

Published

Standard

An Upper Bound on the Size of a Code with the k-Identifiable Parent Property. / Blackburn, S.R.

In: Journal of Combinatorial Theory, Series A, Vol. 102, 2003, p. 179-185.

Research output: Contribution to journalArticlepeer-review

Harvard

Blackburn, SR 2003, 'An Upper Bound on the Size of a Code with the k-Identifiable Parent Property', Journal of Combinatorial Theory, Series A, vol. 102, pp. 179-185.

APA

Blackburn, S. R. (2003). An Upper Bound on the Size of a Code with the k-Identifiable Parent Property. Journal of Combinatorial Theory, Series A, 102, 179-185.

Vancouver

Blackburn SR. An Upper Bound on the Size of a Code with the k-Identifiable Parent Property. Journal of Combinatorial Theory, Series A. 2003;102:179-185.

Author

Blackburn, S.R. / An Upper Bound on the Size of a Code with the k-Identifiable Parent Property. In: Journal of Combinatorial Theory, Series A. 2003 ; Vol. 102. pp. 179-185.

BibTeX

@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.",

}

RIS

TY - JOUR

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

AU - Blackburn, S.R.

N1 - See http://eprint.iacr.org/2002/101

PY - 2003

Y1 - 2003

M3 - Article

VL - 102

SP - 179

EP - 185

JO - Journal of Combinatorial Theory, Series A

JF - Journal of Combinatorial Theory, Series A

SN - 0097-3165

ER -