A1 Refereed original research article in a scientific journal
On codes identifying sets of vertices in Hamming spaces
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: 24
Issue: 2
First page : 193
Last page: 204
Number of pages: 12
ISSN: 0925-1022
DOI: https://doi.org/10.1023/A:1011256721935
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.
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.
UTU Research Portal