A1 Journal article – refereed
Optimal codes for strong identification




List of 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 number: 23
Issue number: 3
Number of pages: 7
ISSN: 0195-6698

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.


Internal Authors/Editors

Last updated on 2019-19-07 at 20:36