Title :
Upper bounds on separating codes
Author :
Cohen, Gérard D. ; Schaathun, Hans Georg
Author_Institution :
Dept. d´´Informatique et Reseaux, Ecole Nat. Superieure des Telecommun., Paris, France
fDate :
6/1/2004 12:00:00 AM
Abstract :
The combinatorial concept of separating systems has numerous applications, such as automata theory, digital fingerprinting, group testing, and hashing. In this correspondence, we derive upper bounds on the size of codes with various separating properties.
Keywords :
combinatorial mathematics; error correction codes; automata theory; combinatorial concept; digital finger printing; error-correcting codes; group testing; hashing; separating codes; separating system; superimposed codes; upper bound; Cryptography; Cyclic redundancy check; Error-correcting codes; hashing; separating systems; superimposed codes;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2004.828140
