Improved bounds on identifying codes in binary Hamming spaces
From MaRDI portal
Publication:966138
DOI10.1016/j.ejc.2009.09.002zbMath1196.94094MaRDI QIDQ966138
Geoffrey Exoo, Tero Laihonen, Sanna Ranto, Ville Junnila
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.09.002
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, On binary linear \(r\)-identifying codes, Partial linear spaces and identifying codes, On the size of identifying codes in binary hypercubes, Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code, Optimal identifying codes of two families of Cayley graphs, Locating and identifying codes in circulant graphs, 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, Identifying codes of corona product graphs, Locating-Domination and Identification
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal cardinalities for identifying and locating-dominating codes in graphs
- Codes identifying sets of vertices in random networks
- New bounds on binary identifying codes
- New identifying codes in the binary Hamming space
- Fault-tolerant locating-dominating sets
- Identifying codes of cycles
- Monotonicity of the minimum cardinality of an identifying code in the hypercube
- A linear algorithm for minimum 1-identifying codes in oriented trees
- On robust and dynamic identifying codes
- Improved Upper Bounds on Binary Identifying Codes
- On a new class of codes for identifying vertices in graphs
- Sequences of optimal identifying codes
- Exact Minimum Density of Codes Identifying Vertices in the Square Grid
- Bounds on identifying codes
