On Codes with the Identifiable Parent Property

Hollmann, Henk D. L.; Lint, J. H. van; Linnartz, Jean-Paul M. G.; Tolhuizen, Ludo

doi:10.1006/jcta.1997.2851

Cited by 146 publications

(123 citation statements)

References 4 publications

Supporting

Mentioning

122

Contrasting

Order By: Relevance

“…It is not difficult to see [6] that identifiable parent property codes [15,24], frameproof codes [2,4], perfect hash families [20,25] and some other structures in digital fingerprinting all imply separable codes.…”

Section: Let M(t N Q) = Max{m | There Exists a T-sc(n M Q)} A T-mentioning

confidence: 99%

New bounds on $$\bar{2}$$ 2 ¯ -separable codes of length 2

Cheng

Jiang

et al. 2013

Des. Codes Cryptogr.

View full text Add to dashboard Cite

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 } ⊆ C is defined to be the set of wordsThe study of separable codes is motivated by questions about multimedia fingerprinting for protecting copyrighted multimedia data. Let M(t, n, q) be the maximal possible size of such a separable code. In this paper, we provide an improved upper bound for M(2, 2, q) by a graph theoretical approach, and a new lower bound for M(2, 2, q) by deleting suitable points and lines from a projective plane, which coincides with the improved upper bound in some places. This corresponds to the bounds of maximum size of bipartite graphs with girth 6 and a construction of such maximal bipartite graphs.

show abstract

Section: Let M(t N Q) = Max{m | There Exists a T-sc(n M Q)} A T-mentioning

confidence: 99%

New bounds on $$\bar{2}$$ 2 ¯ -separable codes of length 2

Cheng

Jiang

et al. 2013

Des. Codes Cryptogr.

View full text Add to dashboard Cite

show abstract

“…Strongly separable codes can be also used to study the classic digital fingerprinting codes such as identifiable parent property (IPP) codes [12], frameproof codes [2,15], perfect hash families (PHFs) [3,16] and so on. In this paper, we will pay our attention to strongly separable codes.…”

Section: Introductionmentioning

confidence: 99%

“…

AbstractAs separable code (SC, IEEE Trans Inf Theory 57:4843-4851, 2011) and frameproof code (FPC, IEEE Trans Inf Theory 44:1897-1905, 1998) do in multimedia fingerprinting, strongly separable code (SSC, Des. Codes and Cryptogr.79:303-318, 2016) can be also used to construct anti-collusion codes.

…”

mentioning

confidence: 99%

Bounds and constructions for 3 ¯ $\overline {3}$ -strongly separable codes with length 3

2017

View full text Add to dashboard Cite

As separable code (SC, IEEE Trans Inf Theory 57:4843-4851, 2011) and frameproof code (FPC, IEEE Trans Inf Theory 44:1897-1905, 1998) do in multimedia fingerprinting, strongly separable code (SSC, Des. Codes and Cryptogr.79:303-318, 2016) can be also used to construct anti-collusion codes. Furthermore, SSC is better than FPC and SC in the applications for multimedia fingerprinting since SSC has lower tracing complexity than that of SC (the same complexity as FPC) and weaker structure than that of FPC. In this paper, we first derive several upper bounds on the number of codewords of t-SSC. Then we focus on 3-SSC with codeword length 3, and obtain the following two main results: (1) An equivalence between an SSC and an SC. (2) An improved lower bound Ω(q 5/3 + q 4/3 − q) on the size of a q-ary SSC when q = q 6 1 for any prime power q 1 ≡ 1 (mod 6), better than the before known bound ⌊ √ q⌋ 3 , which is obtained by means of difference matrix and the known result on the subset of F n q containing no three points on a line.

show abstract

“…They are of interest in combinatorics and can be also used to study the classic digital fingerprinting codes such as identifiable parent property (IPP) codes [9,10], frameproof codes (FPCs) [2,5], perfect hash families (PHFs) [11] and so on. Cheng and Miao [8] pointed out that IPP codes, FPCs, PHFs and some other structures in digital fingerprinting are in fact examples of separable codes with additional properties.…”

Section: Introductionmentioning

confidence: 99%

Bounds and constructions for $${\overline{3}}$$ 3 ¯ -separable codes with length 3

Cheng

Jiang

et al. 2015

Des. Codes Cryptogr.

View full text Add to dashboard Cite

Abstract. Separable codes were 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(C0) of C0 = {c1, c2, . . . , ct} ⊆ C is defined to be the set of words x = (x1, x2, . . . , xn)T such that xi ∈ {c1,i, c2,i, . . . , ct,i} for all i = 1, . . . , n, where cj = (cj,1, cj,2, . . . , cj,n)T . C is a t-separable code if for any two distinct C1, C2 ⊆ C with |C1| ≤ t, |C2| ≤ t, we always have desc(C1) = desc(C2). Let M (t, n, q) denote the maximal possible size of such a separable code. In this paper, an upper bound on M (3, 3, q) is derived by considering an optimization problem related to a partial Latin square, and then two constructions for 3-SC(3, M, q)s are provided by means of perfect hash families and Steiner triple systems.

show abstract

On Codes with the Identifiable Parent Property

Cited by 146 publications

References 4 publications

New bounds on $$\bar{2}$$ 2 ¯ -separable codes of length 2

New bounds on $$\bar{2}$$ 2 ¯ -separable codes of length 2

Bounds and constructions for 3 ¯ $\overline {3}$ -strongly separable codes with length 3

Bounds and constructions for $${\overline{3}}$$ 3 ¯ -separable codes with length 3

Contact Info

Product

Resources

About