Welcome to the resource topic for 2002/101
Title:
An Upper Bound on the Size of a Code with the k-Identifiable Parent Property
Authors: Simon R. Blackburn
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\rightarrow\infty with k and n fixed.
ePrint: https://eprint.iacr.org/2002/101
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .