International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: An Upper Bound on the Size of a Code with the $k$-Identifiable Parent Property

Authors:
Simon R. Blackburn
Download:
URL: http://eprint.iacr.org/2002/101
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2002-11624,
  title={An Upper Bound on the Size of a Code with the $k$-Identifiable Parent Property},
  booktitle={IACR Eprint archive},
  keywords={watermarking, fingerprinting, traitor tracing},
  url={http://eprint.iacr.org/2002/101},
  note={ s.blackburn@rhul.ac.uk 11893 received 25 Jul 2002},
  author={Simon R. Blackburn},
  year=2002
}