A1 Refereed original research article in a scientific journal
Optimal codes for strong identification
Authors: Laihonen T
Publisher: ACADEMIC PRESS LTD ELSEVIER SCIENCE LTD
Publication year: 2002
Journal: European Journal of Combinatorics
Journal name in source: EUROPEAN JOURNAL OF COMBINATORICS
Journal acronym: EUR J COMBIN
Volume: 23
Issue: 3
First page : 307
Last page: 313
Number of pages: 7
ISSN: 0195-6698
DOI: https://doi.org/10.1006/eujc.2002.0571
Abstract
Fault diagnosis of multiprocessor systems gives the motivation for identifying codes. In this paper we provide an infinite sequence of optimal strongly (1, less than or equal to l)-identifying codes in Hamming spaces for every l when l greater than or equal to 3. (C) 2002 Elsevier Science Ltd. All rights reserved.
Fault diagnosis of multiprocessor systems gives the motivation for identifying codes. In this paper we provide an infinite sequence of optimal strongly (1, less than or equal to l)-identifying codes in Hamming spaces for every l when l greater than or equal to 3. (C) 2002 Elsevier Science Ltd. All rights reserved.
UTU Research Portal