Improved constructions of frameproof codes
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 wh...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
2013
|
| Online Access: | https://hdl.handle.net/10356/95980 http://hdl.handle.net/10220/11423 |
| _version_ | 1811688783709470720 |
|---|---|
| author | Chee, Yeow Meng Zhang, Xiande |
| author2 | School of Physical and Mathematical Sciences |
| author_facet | School of Physical and Mathematical Sciences Chee, Yeow Meng Zhang, Xiande |
| author_sort | Chee, Yeow Meng |
| collection | NTU |
| description | 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. |
| first_indexed | 2024-10-01T05:37:42Z |
| format | Journal Article |
| id | ntu-10356/95980 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T05:37:42Z |
| publishDate | 2013 |
| record_format | dspace |
| spelling | ntu-10356/959802020-03-07T12:34:40Z Improved constructions of frameproof codes Chee, Yeow Meng Zhang, Xiande School of Physical and Mathematical Sciences 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. 2013-07-15T06:36:16Z 2019-12-06T19:23:59Z 2013-07-15T06:36:16Z 2019-12-06T19:23:59Z 2012 2012 Journal Article Chee, Y. M., & Zhang, X. (2012). Improved Constructions of Frameproof Codes. IEEE Transactions on Information Theory, 58(8), 5449-5453. https://hdl.handle.net/10356/95980 http://hdl.handle.net/10220/11423 10.1109/TIT.2012.2197812 en IEEE transactions on information theory © 2012 IEEE. |
| spellingShingle | Chee, Yeow Meng Zhang, Xiande Improved constructions of frameproof codes |
| title | Improved constructions of frameproof codes |
| title_full | Improved constructions of frameproof codes |
| title_fullStr | Improved constructions of frameproof codes |
| title_full_unstemmed | Improved constructions of frameproof codes |
| title_short | Improved constructions of frameproof codes |
| title_sort | improved constructions of frameproof codes |
| url | https://hdl.handle.net/10356/95980 http://hdl.handle.net/10220/11423 |
| work_keys_str_mv | AT cheeyeowmeng improvedconstructionsofframeproofcodes AT zhangxiande improvedconstructionsofframeproofcodes |