Frameproof codes were introduced by Boneh and Shaw as a method of “digital
fingerprinting” which prevents a coalition of a specified size c from framing a user not in the …

We consider a general fingerprinting problem of digital data under which coalitions of users
can alter or erase some bits in their copies in order to create an illegal copy. Each user is …

Let C be a code of length n over an alphabet of q letters. An n-word y is called a descendant
of a set of t codewords x 1,..., xt if y_i∈{x^1_i,\dots,x^t_i\} for all i= 1,..., n. A code is said to …

We present new asymptotic bounds for problems in extremal set theory related to finding the
maximum number of qualitatively 3-independent bipartitions of an n-set. We consider the …

Separating codes (or systems) are known from combinatorics, and they enjoy increasing
attention due to applications in digital fingerprinting. Previous applications are found in …

In this paper, we propose a novel reservation system to study partition information and its
transmission over a noise-free Boolean multiaccess channel. The objective of transmission …

Let Γ be a code of length n. Then x is called a descendant of the coalition of codewords a,
b,…, e if xi∈{ai, bi,…, ei} for i= 1,…, n. We study codes with the following property: any two …

In a frequent practical situation one possesses inconsistent fragmentary data concerning
some industrial process or natural phenomenon. It is an interesting and reasonable task to …

We study a wide class of problems in coding theory for which we consider two different
formulations: in terms of incidence matrices and in terms of hypergraphs. These problems …

Separable Collusion-Secure Multimedia Codes | Problems of Information Transmission Skip to
main content SpringerLink Account Menu Find a journal Publish with us Track your research …