A trellis-based bound on (2,1)-separating codes

Authors:
Hans Georg Schaathun;Gérard D. Cohen
Affiliations:
Dept. Informatics, University of Bergen, Bergen, Norway;Dept. Informatique et Reseaux, Ecole Nationale Supérieure des Télécommunications, Paris, France
Venue:
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Year:
2005

Citing 9
Cited 1

On the extremal combinatorics of the Hamming space

Journal of Combinatorial Theory Series A
Supports of a Code

AAECC-11 Proceedings of the 11th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Intersecting codes and separating codes

Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
Entropy/length profiles, bounds on the minimal covering of bipartite graphs, and trellis complexity of nonlinear codes

IEEE Transactions on Information Theory
Collusion-secure fingerprinting for digital data

IEEE Transactions on Information Theory
Generalized Hamming weights of nonlinear codes and the relation to the Z4-linear representation

IEEE Transactions on Information Theory
Combinatorial properties of frameproof and traceability codes

IEEE Transactions on Information Theory
More on (2,2)-separating systems

IEEE Transactions on Information Theory
Asymptotic bounds on frameproof codes

IEEE Transactions on Information Theory

On generalized separating hash families

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

Abstract

We explore some links between higher weights of binary codes based on entropy/length profiles and the asymptotic rate of (2,1)-separating codes. These codes find applications in digital fingerprinting and broadcast encryption for example. We conjecture some bounds on the higher weights, whose proof would considerably strengthen the upper bound on the rate of (2,1)-separating codes.