Name
Abstract | ||
|---|---|---|
Separable codeswere introduced to provide protection against illegal redistribution of copyrighted multimedia material. Let C be a code of length n over an alphabet of q letters. The descendant code desc(C-0) of C-0 = {c(1), c(2),..., c(t)} subset of C is defined to be the set of words x = (x(1), x(2),..., x(n))(T) such that x(i) is an element of {c(1), i, c(2), i,..., c(t, i)} for all i = 1,..., n, where c(j) = (c(j), 1, c(j, 2,)..., c(j, n))(T). C is a (t) over bar -separable code if for any two distinct C-1, C-2 subset of C with vertical bar C-1| <= t, vertical bar C-2 vertical bar <= t, we always have desc(C-1) not equal desc(C-2). Let M((t) over bar, n, q) denote the maximal possible size of such a separable code. In this paper, an upper bound on M((3) over bar, 3, q) is derived by considering an optimization problem, and then two constructions for (3) over bar -SC(3, M, q)s are provided by means of perfect hash families and Steiner triple systems. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/s10623-015-0160-9 | DESIGNS CODES AND CRYPTOGRAPHY |
Keywords | Field | DocType |
Multimedia fingerprinting,Separable code,Partial Latin square,Perfect hash family,Steiner triple system | Discrete mathematics,Combinatorics,Separable space,Mathematics,Alphabet,Steiner system | Journal |
Volume | Issue | ISSN |
81.0 | 2 | 0925-1022 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. Cheng | 1 | 154 | 20.36 |
| Jing Jiang | 2 | 23 | 6.48 |
| Haiyan Li | 3 | 0 | 0.68 |
| Ying Miao | 4 | 491 | 43.85 |
| Xiaohu Tang | 5 | 1294 | 121.15 |