A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
Families of optimal codes for strong identification
Tekijät: Laihonen T, Ranto S
Kustantaja: ELSEVIER SCIENCE BV
Julkaisuvuosi: 2002
Journal: Discrete Applied Mathematics
Tietokannassa oleva lehden nimi: DISCRETE APPLIED MATHEMATICS
Lehden akronyymi: DISCRETE APPL MATH
Artikkelin numero: PII S0166-218X(01)00248-7
Vuosikerta: 121
Numero: 1-3
Aloitussivu: 203
Lopetussivu: 213
Sivujen määrä: 11
ISSN: 0166-218X
DOI: https://doi.org/10.1016/S0166-218X(01)00248-7
Tiivistelmä
Codes for strong identification are considered. The motivation for these codes comes from locating faulty processors in a multiprocessor system, Constructions and lower bounds on these codes are given. In particular, we provide two infinite families of optimal strongly identifying codes, which can locate up to two malfunctioning processors in a binary hypercube. (C) 2002 Elsevier Science B.V. All rights reserved.
Codes for strong identification are considered. The motivation for these codes comes from locating faulty processors in a multiprocessor system, Constructions and lower bounds on these codes are given. In particular, we provide two infinite families of optimal strongly identifying codes, which can locate up to two malfunctioning processors in a binary hypercube. (C) 2002 Elsevier Science B.V. All rights reserved.
Turun yliopiston Tutkimustietojärjestelmän portaali