Fredman-Kolmo´s bounds and information theory
SIAM Journal on Algebraic and Discrete Methods
New bounds for perfect hashing via information theory
European Journal of Combinatorics
Separating partition systems and locally different sequences
SIAM Journal on Discrete Mathematics
Introduction to algorithms
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
On exact specification by examples
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
On the extremal combinatorics of the Hamming space
Journal of Combinatorial Theory Series A
Witness sets for families of binary vectors
Journal of Combinatorial Theory Series A
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
Journal of Combinatorial Theory Series A
A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents
SIAM Journal on Discrete Mathematics
An Efficient Public Key Traitor Tracing Scheme
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Coding Constructions for Blacklisting Problems without Computational Assumptions
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Generalized hashing and parent-identifying codes
Journal of Combinatorial Theory Series A
A Boolean measure of similarity
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
ICMCTA '08 Proceedings of the 2nd international Castle meeting on Coding Theory and Applications
Collusion-secure fingerprinting for digital data
IEEE Transactions on Information Theory
Combinatorial properties of frameproof and traceability codes
IEEE Transactions on Information Theory
Asymptotic bounds on frameproof codes
IEEE Transactions on Information Theory
Upper bounds on separating codes
IEEE Transactions on Information Theory
| Hi-index | 0.01 |
We revisit two notions of difference between codewords, namely separation and the existence of small witnesses, and explore their links.