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

摘要

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--> infinity with k and n fixed. (C) 2003 Elsevier Science (USA). All rights reserved. [References: 7]