Bounds on identifying codes
From MaRDI portal
Publication:5951931
DOI10.1016/S0012-365X(01)00113-3zbMath0991.94061WikidataQ126421919 ScholiaQ126421919MaRDI QIDQ5951931
Simon N. Litsyn, Iiro S. Honkala, Uri Blass
Publication date: 8 January 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Related Items (24)
Optimal codes for strong identification ⋮ Paths and cycles identifying vertices in twisted cubes ⋮ On robust identification in the square and King grids ⋮ Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice ⋮ Open neighborhood locating-dominating in trees ⋮ Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori ⋮ Identifying codes and locating-dominating sets on paths and cycles ⋮ On the identification problems in products of cycles ⋮ The minimum density of an identifying code in the king lattice. ⋮ Locating and identifying codes in circulant networks ⋮ Links Between Discriminating and Identifying Codes in the Binary Hamming Space ⋮ r-Identifying codes in binary Hamming space, q-ary Lee space and incomplete hypercube ⋮ Locating sensors in paths and cycles: the case of 2-identifying codes ⋮ New bounds on binary identifying codes ⋮ Improved bounds on identifying codes in binary Hamming spaces ⋮ New identifying codes in the binary Hamming space ⋮ On identifying codes in binary Hamming spaces ⋮ On binary linear \(r\)-identifying codes ⋮ Identifying codes of cycles ⋮ Monotonicity of the minimum cardinality of an identifying code in the hypercube ⋮ Liar's domination ⋮ Upper bounds for binary identifying codes ⋮ On \(r\)-locating-dominating sets in paths ⋮ On the density of identifying codes in the square lattice
This page was built for publication: Bounds on identifying codes
