Witness sets
RANDRIAMBOLOLONA, Hugues
Laboratoire Traitement et Communication de l'Information [LTCI]
Département Informatique [TSP - INF]
Laboratoire Traitement et Communication de l'Information [LTCI]
Département Informatique [TSP - INF]
RANDRIAMBOLOLONA, Hugues
Laboratoire Traitement et Communication de l'Information [LTCI]
Département Informatique [TSP - INF]
< Reduce
Laboratoire Traitement et Communication de l'Information [LTCI]
Département Informatique [TSP - INF]
Language
en
Communication dans un congrès
This item was published in
Springer LNCS, Springer LNCS, Coding theory and applications, 2008-09. 2008, vol. 5228, p. 37-45
English Abstract
Given a set C of binary n-tuples and c in C, how many bits of c suffice to distinguish it from the other elements in C? We shed new light on this old combinatorial problem and improve on previously known bounds.
Given a set C of binary n-tuples and c in C, how many bits of c suffice to distinguish it from the other elements in C? We shed new light on this old combinatorial problem and improve on previously known bounds.Read less <
Origin
Hal imported