On codes identifying sets of vertices in Hamming spaces

被引：27
|
作者：
Honkala, H
Laihonen, T [1 ]
Ranto, S
机构：
[1] Univ Turku, Dept Math, FIN-20014 Turku, Finland
[2] Univ Turku, Turku Ctr Comp Sci, FIN-20014 Turku, Finland
来源：
DESIGNS CODES AND CRYPTOGRAPHY | 2001年 / 24卷 / 02期
基金：
芬兰科学院;
关键词：
Identifying code; Hamming space; binary codes; sets of vertices; hypercube;
D O I：
10.1023/A:1011256721935
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A code C subset of or equal to F-2(n) is called (t, less than or equal to2)-identifying if for all the words x, y (x not equal y) and z the sets (B-t (x) boolean OR B-t (y)) boolean AND C and B-t (z) boolean AND C are nonempty and different. Constructions of such codes and a lower bound on the cardinality of these codes are given. The lower bound is shown to be sharp in some cases. We also discuss a more general notion of (t, F)-identifying codes and introduce weakly identifying codes.
引用
收藏
页码：193 / 204
页数：12
相关论文
共 50 条
  • [1] On Codes Identifying Sets of Vertices in Hamming Spaces
    Iiro Honkala
    Tero Laihonen
    Sanna Ranto
    Designs, Codes and Cryptography, 2001, 24 : 193 - 204
  • [2] Constructing codes identifying sets of vertices
    Julien Moncel
    Designs, Codes and Cryptography, 2006, 41 : 23 - 31
  • [3] On identifying codes in binary Hamming spaces
    Honkala, I
    Lobstein, A
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2002, 99 (02) : 232 - 243
  • [4] Constructing codes identifying sets of vertices
    Moncel, Julien
    DESIGNS CODES AND CRYPTOGRAPHY, 2006, 41 (01) : 23 - 31
  • [5] Construction of codes identifying sets of vertices
    Gravier, S
    Moncel, J
    ELECTRONIC JOURNAL OF COMBINATORICS, 2005, 12 (01):
  • [6] On graphs admitting codes identifying sets of vertices
    Laihonen, Tero
    Moncel, Julien
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2008, 41 : 81 - 91
  • [7] Codes identifying sets of vertices in random networks
    Frieze, Alan
    Martin, Ryan
    Moncel, Julien
    Ruszinko, Miklos
    Smyth, Cliff
    DISCRETE MATHEMATICS, 2007, 307 (9-10) : 1094 - 1107
  • [8] Improved bounds on identifying codes in binary Hamming spaces
    Exoo, Geoffrey
    Junnila, Ville
    Laihonen, Tero
    Ranto, Sanna
    EUROPEAN JOURNAL OF COMBINATORICS, 2010, 31 (03) : 813 - 827
  • [9] Two families of optimal identifying codes in binary Hamming spaces
    Ranto, SM
    Honkala, IS
    Laihonen, TK
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (05) : 1200 - 1203
  • [10] New identifying codes in the binary Hamming space
    Charon, Irene
    Cohen, Gerard
    Hudry, Olivier
    Lobstein, Antoine
    EUROPEAN JOURNAL OF COMBINATORICS, 2010, 31 (02) : 491 - 501
12345