New identifying codes in the binary Hamming space
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.
- Bounds on identifying codes
- scientific article; zbMATH DE number 1735664 (Why is no real title available?)
- scientific article; zbMATH DE number 1504659 (Why is no real title available?)
- scientific article; zbMATH DE number 1522566 (Why is no real title available?)
- scientific article; zbMATH DE number 1436153 (Why is no real title available?)
- Identifying codes with small radius in some infinite regular graphs
- Improved Upper Bounds on Binary Identifying Codes
- Monotonicity of the minimum cardinality of an identifying code in the hypercube
- New bounds on binary identifying codes
- On a new class of codes for identifying vertices in graphs
- On identifying codes in binary Hamming spaces
- On the complexity of the identification problem in Hamming spaces
- The noising methods: A generalization of some metaheuristics
- Upper bounds for binary identifying codes
- On the complexity of the identification problem in Hamming spaces
- On regular and new types of codes for location-domination
- Sufficient conditions for a digraph to admit a (1, )-identifying code
- Improved lower bound for locating-dominating codes in binary Hamming spaces
- On t-revealing codes in binary Hamming spaces
- Constructions of r-identifying codes and (r, l)-identifying codes
- A novel maximum distance separable code to generate universal identifiers
- Identifying codes and searching with balls in graphs
- New results on variants of covering codes in Sierpiński graphs
- Locating and identifying codes in circulant networks
- More results on the complexity of identifying problems in graphs
- Locating-domination and identification
- \(r\)-identifying codes in binary Hamming space, \(q\)-ary Lee space and incomplete hypercube
- Bounds on r-identifying codes in q-ary Lee space
- Identifying codes in line graphs
- Links Between Discriminating and Identifying Codes in the Binary Hamming Space
- Identifying codes in \(q\)-ary hypercubes
- On binary linear \(r\)-identifying codes
- Bounds on identifying codes
- Partial linear spaces and identifying codes
- On Iiro Honkala's contributions to identifying codes
- Optimal local identifying and local locating-dominating codes
- On identifying codes in binary Hamming spaces
- Linear and group identifying codes in Hamming graphs
- New bounds on binary identifying codes
- Improved bounds on identifying codes in binary Hamming spaces
This page was built for publication: New identifying codes in the binary Hamming space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q966160)
