Cryptology ePrint Archive: Report 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.

Category / Keywords: watermarking, fingerprinting, traitor tracing

Date: received 25 Jul 2002

Contact author: s blackburn at rhul ac uk

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20020725:163418 (All versions of this report)

Short URL: ia.cr/2002/101

Discussion forum: Show discussion | Start new discussion