New identifying codes in the binary Hamming space (Q966160): Difference between revisions

The paper gives some new constructive upper bounds for the minimum cardinalities of \(r\)-identifying codes in Hamming space. Several useful constructions for identifying codes are presented. These constructions are supported by proved theorems and examples. In the paper are also presented some heuristics (noising and greedy) that help to build good identifying codes. Finally all these methods are applied to produce new results about upper bounds for the minimum cardinalities of r-identifying codes. This paper definitely presents valuable results in the field of identifying codes. Also it is very well written with a lot examples and explanations. All the definitions and theorems needed to get common with identifying codes are given and proved. I recommend this paper for anybody who wants to start a deep research in this scientific field.