Identifying Codes and Covering Problems

DOI10.1109/TIT.2008.928263zbMath1318.94123OpenAlexW2132014457MaRDI QIDQ3604840

Ari Trachtenberg, Moshe Laifenfeld

Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2008.928263

Mathematics Subject Classification ID

Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Combinatorial aspects of packing and covering (05B40)

Related Items (12)

Identifying Codes in Hereditary Classes of Graphs and VC-Dimension ⋮ Bounds on r-identifying codes in q-ary Lee space ⋮ Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes ⋮ Complexity and approximation for discriminating and identifying code problems in geometric setups ⋮ On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results ⋮ Identification in \(\mathbb Z^2\) using Euclidean balls ⋮ r-Identifying codes in binary Hamming space, q-ary Lee space and incomplete hypercube ⋮ Discriminating Codes in Geometric Setups ⋮ Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes ⋮ On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\) ⋮ Constructions of \(r\)-identifying codes and \((r, \leq l)\)-identifying codes ⋮ Open locating-dominating sets in circulant graphs

This page was built for publication: Identifying Codes and Covering Problems