A1 Refereed original research article in a scientific journal
On strongly identifying codes
Authors: Honkala I, Laihonen T, Ranto S
Publisher: ELSEVIER SCIENCE BV
Publication year: 2002
Journal: Discrete Mathematics
Journal name in source: DISCRETE MATHEMATICS
Journal acronym: DISCRETE MATH
Volume: 254
Issue: 1-3
First page : 191
Last page: 205
Number of pages: 15
ISSN: 0012-365X
DOI: https://doi.org/10.1016/S0012-365X(01)00357-0
Abstract
Identifying codes are designed for locating faulty processors in multiprocessor systems. In this paper we consider a natural extension of this problem and introduce strongly identifying codes. Several lower bounds and constructions are given and relations between different types of identifying codes are examined. (C) 2002 Elsevier Science B.V. All rights reserved.
Identifying codes are designed for locating faulty processors in multiprocessor systems. In this paper we consider a natural extension of this problem and introduce strongly identifying codes. Several lower bounds and constructions are given and relations between different types of identifying codes are examined. (C) 2002 Elsevier Science B.V. All rights reserved.
UTU Research Portal