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

22Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

Abstract

The paper gives an upper bound on the size of a q-ary code of length n that has the k-identifiable parent property. One consequence of this bound is that the optimal rate of such a code is determined in many cases when q → ∞ with k and n fixed. © 2003 Elsevier Science (USA). All rights reserved.

Cite

CITATION STYLE

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(1), 179–185. https://doi.org/10.1016/S0097-3165(03)00030-X

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free