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...
Saved in:
Main Authors: | Chee, Yeow Meng, Zhang, Xiande |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2013
|
Online Access: | https://hdl.handle.net/10356/95980 http://hdl.handle.net/10220/11423 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Asymptotic bounds on frameproof codes
by: Xing, C.
Published: (2014) -
New Bounds on 2-Frameproof Codes of Length 4
by: Penying Rochanakul
Published: (2020) -
Optimal codes in the Enomoto-Katona space
by: Chee, Yeow Meng, et al.
Published: (2014) -
Decompositions of edge-colored digraphs : a new technique in the construction of constant-weight codes and related families
by: Chee, Yeow Meng, et al.
Published: (2019) -
Constructions for q-ary constant-weight codes
by: Chee, Yeow Meng, et al.
Published: (2009)