A1 Refereed original research article in a scientific journal
Families of optimal codes for strong identification
Authors: Laihonen T, Ranto S
Publisher: ELSEVIER SCIENCE BV
Publication year: 2002
Journal: Discrete Applied Mathematics
Journal name in source: DISCRETE APPLIED MATHEMATICS
Journal acronym: DISCRETE APPL MATH
Article number: PII S0166-218X(01)00248-7
Volume: 121
Issue: 1-3
First page : 203
Last page: 213
Number of pages: 11
ISSN: 0166-218X
DOI: https://doi.org/10.1016/S0166-218X(01)00248-7
Abstract
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.
UTU Research Portal