Back to Search Start Over

Families of optimal codes for strong identification

Authors :
Sanna Ranto
Tero Laihonen
Source :
Discrete Applied Mathematics. (1-3):203-213
Publisher :
Elsevier Science B.V.

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.

Subjects

Subjects :
Block code
Theoretical computer science
Hamming space
Applied Mathematics
ComputerSystemsOrganization_PROCESSORARCHITECTURES
Linear code
Online codes
Computer Science::Hardware Architecture
Optimal code
Binary code
Identifying code
Turbo code
Discrete Mathematics and Combinatorics
Hypercube
Computer Science::Operating Systems
Hamming code
Mathematics
Strongly identifying code

Details

Language :
English
ISSN :
0166218X
Issue :
1-3
Database :
OpenAIRE
Journal :
Discrete Applied Mathematics
Accession number :
edsair.doi.dedup.....60ac3ef6be1c206e24b23d5d1b8d2c04
Full Text :
https://doi.org/10.1016/S0166-218X(01)00248-7
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details