Sequences of optimal identifying codes

被引：26

作者：

Laihonen, TK ^{[1
]}

机构：

[1] Univ Turku, Dept Math, FIN-20014 Turku, Finland

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2002年 / 48卷 / 03期

基金：

芬兰科学院;

关键词：

binary Hamming space; binary hypercube; covering code; identifying code; optimal code;

D O I：

10.1109/18.986043

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Locating faulty processors in a multiprocessor system gives the motivation for identifying codes. Denote by I the maximum number of simultaneously malfunctioning processors. In this correspondence, we show that if l greater than or equal to 3, then the problem of finding the smallest cardinality of a (1, less than or equal tol)-iiientifying code in a binary hypercube is equivalent to the problem of finding the smallest size of a (2l - I) -fold 1-covering. This observation yields infinite sequences of optimal identifying codes for every l (l greater than or equal to 3).

引用

页码：774 / 776

页数：3