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
相关论文
共 50 条
  • [1] Optimal linear identifying codes
    Ranto, SM
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (06) : 1544 - 1547
  • [2] Optimal Identifying Codes in Cycles and Paths
    Junnila, Ville
    Laihonen, Tero
    GRAPHS AND COMBINATORICS, 2012, 28 (04) : 469 - 481
  • [3] Optimal Identifying Codes in Cycles and Paths
    Ville Junnila
    Tero Laihonen
    Graphs and Combinatorics, 2012, 28 : 469 - 481
  • [4] An Optimal Result for Codes Identifying Sets of Words
    Janson, Svante
    Laihonen, Tero
    2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, : 2547 - +
  • [5] Some sequences of optimal constant weight codes
    Sun, Hsin-Min
    JOURNAL OF ALGEBRA AND ITS APPLICATIONS, 2018, 17 (02)
  • [6] Optimal error-detection system for identifying codes
    Jean, Devin C.
    Seo, Suk J.
    NETWORKS, 2025, 85 (01) : 61 - 75
  • [7] Optimal identifying codes of two families of Cayley graphs
    Feng, Min
    Ma, Xuanlong
    Feng, Lihua
    DISCRETE APPLIED MATHEMATICS, 2022, 320 : 199 - 210
  • [8] A family of optimal identifying codes in Z2
    Honkala, Iiro
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2006, 113 (08) : 1760 - 1763
  • [9] Optimal Local Identifying and Local Locating-dominating Codes
    Herva, Pyry
    Laihonen, Tero
    Lehtila, Tuomo
    FUNDAMENTA INFORMATICAE, 2024, 191 (3-4) : 351 - 378
  • [10] On the ensemble of optimal identifying codes in a twin-free graph
    Iiro Honkala
    Olivier Hudry
    Antoine Lobstein
    Cryptography and Communications, 2016, 8 : 139 - 153
12345