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. © Springer-Verlag Berlin Heidelberg 2005.
Author supplied keywords
Cite
CITATION STYLE
Schaathun, H. G., & Cohen, G. D. (2005). A trellis-based bound on (2, 1)-separating codes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3796 LNCS, pp. 59–67). https://doi.org/10.1007/11586821_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
