Abstract | ||
---|---|---|
Binary -frameproof codes (-FPCs) are used in multimedia fingerprinting schemes where the identification of authorized users taking part in the averaging collusion attack is required. In this paper, a binary strongly -separable code (-SSC) is introduced to improve such a scheme based on a binary -FPC. A binary -SSC has the same traceability as a binary -FPC but has more codewords than a binary -FPC. A composition construction for binary -SSCs from -ary -SSCs is described, which stimulates the research on -ary -SSCs with short length. Several infinite series of optimal -ary -SSCs of length are derived from the fact that a -ary -SSC of length is equivalent to a -ary -separable code of length . Combinatorial properties of -ary -SSCs of length are investigated, and a construction for -ary -SSCs of length is provided. These -SSCs of length have more than codewords than -FPCs of length could have. |
Year | DOI | Venue |
---|---|---|
2014 | 10.1007/s10623-015-0050-1 | Designs, Codes and Cryptography |
Keywords | Field | DocType |
Multimedia fingerprinting,Separable code,Strongly separable code,Frameproof code,Tracing algorithm,94A62,94B25,68P30 | Discrete mathematics,Combinatorics,Series (mathematics),Separable space,Overline,Mathematics,Binary number | Journal |
Volume | Issue | ISSN |
abs/1412.6128 | 2 | 0925-1022 |
Citations | PageRank | References |
3 | 0.44 | 8 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jing Jiang | 1 | 23 | 6.48 |
M. Cheng | 2 | 154 | 20.36 |
Ying Miao | 3 | 491 | 43.85 |