New bounds on binary identifying codes
From MaRDI portal
Publication:947104
DOI10.1016/j.dam.2007.09.017zbMath1154.94013OpenAlexW1976667255MaRDI QIDQ947104
Geoffrey Exoo, Sanna Ranto, Tero Laihonen
Publication date: 29 September 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.09.017
Related Items (8)
Identifying codes in vertex-transitive graphs and strongly regular graphs ⋮ Improved bounds on identifying codes in binary Hamming spaces ⋮ New identifying codes in the binary Hamming space ⋮ Constructions of \(r\)-identifying codes and \((r, \leq l)\)-identifying codes ⋮ Upper bounds for binary identifying codes ⋮ Locating-Domination and Identification ⋮ On the size of identifying codes in binary hypercubes ⋮ Identifying codes and searching with balls in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Extremal cardinalities for identifying and locating-dominating codes in graphs
- On identifying codes in the hexagonal mesh
- On the density of identifying codes in the square lattice
- Improved Upper Bounds on Binary Identifying Codes
- Do most binary linear codes achieve the Goblick bound on the covering radius? (Corresp.)
- On a new class of codes for identifying vertices in graphs
- Sequences of optimal identifying codes
- On Identifying Codes in the Triangular and Square Grids
- Two families of optimal identifying codes in binary Hamming spaces
- On codes identifying sets of vertices in Hamming spaces
- Bounds on identifying codes
This page was built for publication: New bounds on binary identifying codes