On codes identifying sets of vertices in Hamming spaces



: Honkala I, Laihonen T, Ranto S

Publisher: KLUWER ACADEMIC PUBL

: 2001

: Designs, Codes and Cryptography

: DESIGNS CODES AND CRYPTOGRAPHY

: DESIGN CODE CRYPTOGR

: 24

: 2

: 193

: 204

: 12

: 0925-1022

DOI: https://doi.org/10.1023/A:1011256721935


A code C subset of or equal to F-2(n) is called (t, less than or equal to2)-identifying if for all the words x, y (x not equal y) and z the sets (B-t (x) boolean OR B-t (y)) boolean AND C and B-t (z) boolean AND C are nonempty and different. Constructions of such codes and a lower bound on the cardinality of these codes are given. The lower bound is shown to be sharp in some cases. We also discuss a more general notion of (t, F)-identifying codes and introduce weakly identifying codes.



Last updated on 2024-26-11 at 15:55