Intersecting codes and separating codes

Authors:
G. Cohnen;S. Encheva;S. Litsyn;H. G. Schaathun
Affiliations:
Ecole Nationale Supérieure des Télécommunications, 46 rue Barrault, 75634 Paris, France;Stord/Haugesund College, Bjørnsonsg. 45, 5528 Haugesund, Norway;Dept. of Informatics, UiB, HIB, N-5020, Bergen, Norway;EES Dept., Tel Aviv University, 69978 Ramat Aviv, Israel
Venue:
Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
Year:
2003

Citing 8
Cited 4

Separating partition systems and locally different sequences

SIAM Journal on Discrete Mathematics
Algebraic-geometric codes and asymptotic problems

Discrete Applied Mathematics - Special volume on applied algebra, algebraic algorithms, and error-correcting codes
Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes

SIAM Journal on Discrete Mathematics
On codes with the identifiable parent property

Journal of Combinatorial Theory Series A
A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents

SIAM Journal on Discrete Mathematics
Tracing Traitors

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Collusion-Secure Fingerprinting for Digital Data (Extended Abstract)

CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
More on (2,2)-separating systems

IEEE Transactions on Information Theory

On generalized separating hash families

Journal of Combinatorial Theory Series A
Fighting two pirates

AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Worst-case optimal fingerprinting codes for non-threshold collusion

DRMTICS'05 Proceedings of the First international conference on Digital Rights Management: technologies, Issues, Challenges and Systems
A trellis-based bound on (2,1)-separating codes

IMA'05 Proceedings of the 10th international conference on Cryptography and Coding

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 non-intersecting coalitions of a limited size have no common descendant.We present constructions based on linear intersecting codes.