 |
|
 |
|
|
|
|
|
| HAL: hal-00358468, version 1 |
| arXiv: 0902.0583 |
| Detailed view |  Export this paper |
|
|
| Coding theory and applications, Espagne (2008) |
|
|
|
|
| Witness sets |
|
|
| Gerard Cohen 1Hugues Randriam 1, 2 |
|
|
| (2008) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire Traitement et Communication de l'Information [Paris] (LTCI) |
|
|
|
Télécom ParisTech – CNRS : UMR5141 |
|
|
| 2: | Département Informatique (INF) |
|
|
|
Institut Mines-Télécom – Télécom SudParis |
|
|
| 3: | Institut de Mathématiques de Bordeaux (IMB) |
|
|
|
CNRS : UMR5251 – Université Sciences et Technologies - Bordeaux I – Université Victor Segalen - Bordeaux II |
|
|
|
|
|
|
|
|
|
| Subject | : | Mathematics/Combinatorics |
|
|
| Attached file list to this document: | ||||||||||
|
||||||||||
|
|
|
| hal-00358468, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00358468 | |
| oai:hal.archives-ouvertes.fr:hal-00358468 | |
| From: Gerard Cohen | |
| Submitted on: Tuesday, 3 February 2009 15:28:58 | |
| Updated on: Tuesday, 3 February 2009 20:29:15 | |
