Paper 2002/101

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

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.

Metadata
Available format(s)
PDF PS
Publication info
Published elsewhere. Unknown where it was published
Keywords
watermarkingfingerprintingtraitor tracing
Contact author(s)
s blackburn @ rhul ac uk
History
2002-07-25: received
Short URL
https://ia.cr/2002/101
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2002/101,
      author = {Simon R.  Blackburn},
      title = {An Upper Bound on the Size of a Code with the $k$-Identifiable Parent Property},
      howpublished = {Cryptology ePrint Archive, Paper 2002/101},
      year = {2002},
      note = {\url{https://eprint.iacr.org/2002/101}},
      url = {https://eprint.iacr.org/2002/101}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.