A1 Refereed original research article in a scientific journal
Improved upper bounds on binary identifying codes
Authors: Exoo G, Laihonen T, Ranto S
Publisher: IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Publication year: 2007
Journal: IEEE Transactions on Information Theory
Journal name in source: IEEE TRANSACTIONS ON INFORMATION THEORY
Journal acronym: IEEE T INFORM THEORY
Volume: 53
Issue: 11
First page : 4255
Last page: 4260
Number of pages: 6
ISSN: 0018-9448
DOI: https://doi.org/10.1109/TIT.2007.907434
Abstract
In binary Hamming spaces, we construct new 1-identifying codes from 2-fold 1-coverings that are 1-identifying. We improve on previously known upper bounds for the cardinalities of I-identifying codes of many lengths when n >= 10. We construct t-identifying codes using the direct sum of t I-identifying codes. This solves partly an open problem posed by Blass, Honkala, and Litsyn in 2001. We also prove a general result concerning the direct sum of a t-identifying code with the whole space of any dimension.
In binary Hamming spaces, we construct new 1-identifying codes from 2-fold 1-coverings that are 1-identifying. We improve on previously known upper bounds for the cardinalities of I-identifying codes of many lengths when n >= 10. We construct t-identifying codes using the direct sum of t I-identifying codes. This solves partly an open problem posed by Blass, Honkala, and Litsyn in 2001. We also prove a general result concerning the direct sum of a t-identifying code with the whole space of any dimension.
UTU Research Portal