Witness sets
| dc.creator | Cohen, Gerard | |
| dc.creator | Randriam, Hugues | |
| dc.creator | Zemor, Gilles | |
| dc.date | 2009-02-03 | |
| dc.date.accessioned | 2026-07-07T12:37:21Z | |
| dc.date.available | 2026-07-07T12:37:21Z | |
| dc.description | 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. | |
| dc.description | Coding theory and applications, Espagne (2008) | |
| dc.identifier | https://arxiv.org/abs/0902.0583 | |
| dc.identifier | http://arxiv.org/abs/0902.0583 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/218413 | |
| dc.subject | Combinatorics | |
| dc.title | Witness sets | |
| dc.type | text |