A1 Journal article – refereed
On codes identifying sets of vertices in Hamming spaces




List of Authors: Honkala I, Laihonen T, Ranto S
Publisher: KLUWER ACADEMIC PUBL
Publication year: 2001
Journal: Designs, Codes and Cryptography
Journal name in source: DESIGNS CODES AND CRYPTOGRAPHY
Journal acronym: DESIGN CODE CRYPTOGR
Volume number: 24
Issue number: 2
ISSN: 0925-1022

Abstract
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.


Research Areas


Last updated on 2019-29-01 at 11:37