Witness sets

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

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.
Coding theory and applications, Espagne (2008)

Keywords

Combinatorics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/218413

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0902.0583
 http://arxiv.org/abs/0902.0583

Collections

arXiv