Improved upper bounds on binary identifying codes



: Exoo G, Laihonen T, Ranto S

Publisher: IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC

: 2007

: IEEE Transactions on Information Theory

: IEEE TRANSACTIONS ON INFORMATION THEORY

: IEEE T INFORM THEORY

: 53

: 11

: 4255

: 4260

: 6

: 0018-9448

DOI: https://doi.org/10.1109/TIT.2007.907434


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.



Last updated on 2024-26-11 at 11:06