Please use this identifier to cite or link to this item:
|Title:||Improved constructions of frameproof codes||Authors:||Chee, Yeow Meng
|Issue Date:||2012||Source:||Chee, Y. M., & Zhang, X. (2012). Improved Constructions of Frameproof Codes. IEEE Transactions on Information Theory, 58(8), 5449-5453.||Series/Report no.:||IEEE transactions on information theory||Abstract:||Frameproof codes are used to preserve the security in the context of coalition when fingerprinting digital data. Let Mc,l(q) be the largest cardinality of a q-ary c-frameproof code of length l and Rc,l=limq→∞ Mc,l(q)/q[ l/c]. It has been determined by Blackburn that Rc,l=1 when l≡1(mod c), Rc,l=2 when c=2 and l is even, and R3,5=5/3. In this paper, we give a recursive construction for c-frameproof codes of length l with respect to the alphabet size q . As applications of this construction, we establish the existence results for q-ary c-frameproof codes of length c+2 and size c+2/c(q-1)2+1 for all odd q when c=2 and for all q≡4 when c=3 . Furthermore, we show that Rc,c+2=(c+2)/c meeting the upper bound given by Blackburn, for all integers c such that c+1 is a prime power.||URI:||https://hdl.handle.net/10356/95980
|DOI:||10.1109/TIT.2012.2197812||Rights:||© 2012 IEEE.||Fulltext Permission:||none||Fulltext Availability:||No Fulltext|
|Appears in Collections:||SPMS Journal Articles|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.