Title of article
An upper bound on the size of a code with the k-identifiable parent property
Author/Authors
Blackburn، نويسنده , , Simon R، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
7
From page
179
To page
185
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.
Keywords
Identifiable parent property , Fingerprinting
Journal title
Journal of Combinatorial Theory Series A
Serial Year
2003
Journal title
Journal of Combinatorial Theory Series A
Record number
1530780
Link To Document