New identifying codes in the binary Hamming space
From MaRDI portal
Publication:966160
DOI10.1016/j.ejc.2009.03.032zbMath1198.94175MaRDI QIDQ966160
Olivier Hudry, Irène Charon, Gérard D. Cohen, Antoine C. Lobstein
Publication date: 27 April 2010
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2009.03.032
Related Items
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, More results on the complexity of identifying problems in graphs, On binary linear \(r\)-identifying codes, Partial linear spaces and identifying codes, Improved bounds on identifying codes in binary Hamming spaces, Upper bounds for binary identifying codes, On regular and new types of codes for location-domination, Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code, Improved lower bound for locating-dominating codes in binary Hamming spaces, Constructions of \(r\)-identifying codes and \((r, \leq l)\)-identifying codes, 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, Locating-Domination and Identification
Cites Work
- On identifying codes in binary Hamming spaces
- New bounds on binary identifying codes
- On the complexity of the identification problem in Hamming spaces
- Monotonicity of the minimum cardinality of an identifying code in the hypercube
- Improved Upper Bounds on Binary Identifying Codes
- On a new class of codes for identifying vertices in graphs
- Bounds on identifying codes
- The noising methods: A generalization of some metaheuristics
- Identifying codes with small radius in some infinite regular graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
