Title :
Generalized Witness Sets
Author :
Cohen, Gérard ; Mesnager, Sihem
Author_Institution :
Telecom ParisTech, Paris, France
Abstract :
Given a set C of q-ary n-tuples and c ∈ C, how many symbols of c suffice to distinguish it from the other elements in C? This is a generalization of an old combinatorial problem, on which we present (asymptotically tight) bounds and variations.
Keywords :
learning (artificial intelligence); set theory; combinatorial problem generalization; generalized witness sets; q-ary n-tuples; Conferences; Educational institutions; Electronic mail; Encoding; Hamming distance; Upper bound;
Conference_Titel :
Data Compression, Communications and Processing (CCP), 2011 First International Conference on
Conference_Location :
Palinuro
Print_ISBN :
978-1-4577-1458-0
Electronic_ISBN :
978-0-7695-4528-8
DOI :
10.1109/CCP.2011.12
