Cover-free codes and separating system codes

On separating codes

Let Γ be a code of length n, and (T,U ) a pair of disjoint subsets of Γ. We say that (T,U ) is separated if there exists a coordinate i, such that for any codeword (c1, . . . , cn) ∈ T and any codeword (c ′ 1, . . . , c ′ n) ∈ U , ci 6= c ′ i. The code Γ is (t,u)-separating if all pairs (T,U ) with #T = t and #U = u are separated. Separating codes (or systems) are known from combinatorics, and ...

Separating Codes: Constructions and Bounds

Separating codes, initially introduced to test automaton, have revived lately in the study of fingerprinting codes, which are used for copyright protection. Separating codes play their role in making the fingerprinting scheme secure agains coalitions of pirates. We provide here better bounds, constructions and generalizations for these codes.

Cover - Free Families and Superimposed Codes : Constru tions ,

Asymptotic Overview on Separating Codes

Separating codes (or systems) are known from combinatorics, and they enjoy increasing attention due to applications in digital fingerprinting. Previous applications are found in automata theory and the construction of fault-tolerant systems. Let Γ be a code of length n, and (T,U ) a pair of disjoint subsets of Γ. We say that (T,U ) is separated if there exists a coordinate i, such that for any ...

Anti-Collusion Digital Fingerprinting Codes via Partially Cover-Free Families

Anti-collusion digital fingerprinting codes have been of significant current interest in the context of deterring unauthorized use of multimedia content by a coalition of users. In this article, partially coverfree families of sets are considered and these are employed to obtain such codes. Compared to the existing methods of construction, our methods ensure gains in terms of accommodating more...