HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Witness sets

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [5 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00358468
Contributor : Gerard Cohen Connect in order to contact the contributor
Submitted on : Tuesday, February 3, 2009 - 3:28:58 PM
Last modification on : Monday, January 24, 2022 - 11:43:20 AM
Long-term archiving on: : Tuesday, June 8, 2010 - 6:15:59 PM

Files

CRZwitness.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00358468, version 1
  • ARXIV : 0902.0583

Citation

Gerard Cohen, Hugues Randriambololona, Gilles Zemor. Witness sets. Coding theory and applications, Sep 2008, Spain. pp.37-45. ⟨hal-00358468⟩

Share

Metrics

Record views

183

Files downloads

60