A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
On strongly identifying codes
Tekijät: Honkala I, Laihonen T, Ranto S
Kustantaja: ELSEVIER SCIENCE BV
Julkaisuvuosi: 2002
Journal: Discrete Mathematics
Tietokannassa oleva lehden nimi: DISCRETE MATHEMATICS
Lehden akronyymi: DISCRETE MATH
Vuosikerta: 254
Numero: 1-3
Aloitussivu: 191
Lopetussivu: 205
Sivujen määrä: 15
ISSN: 0012-365X
DOI: https://doi.org/10.1016/S0012-365X(01)00357-0
Tiivistelmä
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.
Turun yliopiston Tutkimustietojärjestelmän portaali