1,934 research outputs found
Improved Constructions of Frameproof Codes
Frameproof codes are used to preserve the security in the context of
coalition when fingerprinting digital data. Let be the largest
cardinality of a -ary -frameproof code of length and
. It has
been determined by Blackburn that when ,
when and is even, and . In this paper, we
give a recursive construction for -frameproof codes of length with
respect to the alphabet size . As applications of this construction, we
establish the existence results for -ary -frameproof codes of length
and size for all odd when and for all
when . Furthermore, we show that
meeting the upper bound given by Blackburn, for all integers such that
is a prime power.Comment: 6 pages, to appear in Information Theory, IEEE Transactions o
- β¦