Back to Search Start Over

Optimal Codes for Strong Identification

Authors :
Tero Laihonen
Source :
European Journal of Combinatorics. 23:307-313
Publication Year :
2002
Publisher :
Elsevier BV, 2002.

Abstract

Fault diagnosis of multiprocessor systems gives the motivation for identifying codes. In this paper we provide an infinite sequence of optimal strongly (1, ≤l)-identifying codes in Hamming spaces for every l when l≥ 3.

Subjects

Subjects :
Block code
Discrete mathematics
Theoretical computer science
Multiprocessing
Fault (power engineering)
Linear code
Theoretical Computer Science
Combinatorics
Computer Science::Hardware Architecture
Identification (information)
Computational Theory and Mathematics
Discrete Mathematics and Combinatorics
Geometry and Topology
Computer Science::Operating Systems
Hamming code
Mathematics

Details

ISSN :
01956698
Volume :
23
Database :
OpenAIRE
Journal :
European Journal of Combinatorics
Accession number :
edsair.doi.dedup.....924784fc912a42e51392d85a7e43a93a
Full Text :
https://doi.org/10.1006/eujc.2002.0571
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details