On Identifying Codes in Binary Hamming S
β
Iiro Honkala; Antoine Lobstein
π
Article
π
2002
π
Elsevier Science
π
English
β 138 KB
A binary code C f0; 1g n is called r-identifying, if the sets B r Γ°xΓ \ C; where B r Γ°xΓ is the set of all vectors within the Hamming distance r from x; are all nonempty and no two are the same. Denote by M r Γ°nΓ the minimum possible cardinality of a binary r-identifying code in f0; 1g n : We prove