Exact Minimum Density of Codes Identifying Vertices in the Square Grid
From MaRDI portal
Publication:5317597
DOI10.1137/S0895480104444089zbMath1085.94026MaRDI QIDQ5317597
Yael Ben-Haim, Simon N. Litsyn
Publication date: 16 September 2005
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Lattice packing and covering (number-theoretic aspects) (11H31) Theory of error-correcting codes and error-detecting codes (94B99) Combinatorial aspects of packing and covering (05B40)
Related Items (35)
Identifying codes in the complementary prism of cycles ⋮ On identifying codes that are robust against edge changes ⋮ On a new class of identifying codes in graphs ⋮ New results on variants of covering codes in Sierpiński graphs ⋮ On robust identification in the square and King grids ⋮ Optimal identifying codes of two families of Cayley graphs ⋮ Tolerant identification with Euclidean balls ⋮ On minimum identifying codes in some Cartesian product graphs ⋮ The number of completely different optimal identifying codes in the infinite square grid ⋮ Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes ⋮ Fault tolerant detectors for distinguishing sets in graphs ⋮ Identification in \(\mathbb Z^2\) using Euclidean balls ⋮ Periodicity of identifying codes in strips ⋮ An improved lower bound for \((1,\leq 2)\)-identifying codes in the king grid ⋮ Identifying codes of the direct product of two cliques ⋮ New lower bound for 2-identifying code in the square grid ⋮ New bounds on the minimum density of an identifying code for the infinite hexagonal grid ⋮ Identifying codes in the direct product of a complete graph and some special graphs ⋮ Identifying codes of corona product graphs ⋮ Locating and identifying codes in circulant graphs ⋮ New results of identifying codes in product graphs ⋮ Adaptive identification in graphs ⋮ Identifying codes for infinite triangular grids with a finite number of rows ⋮ Improved bounds on identifying codes in binary Hamming spaces ⋮ Minimum density of identifying codes of king grids ⋮ Liar's domination ⋮ Minimum density of identifying codes of king grids ⋮ Locating-Domination and Identification ⋮ Locating and identifying codes in dihedral graphs ⋮ On the size of identifying codes in binary hypercubes ⋮ Optimal bounds on codes for location in circulant graphs ⋮ Minimum-Density Identifying Codes in Square Grids ⋮ Open-independent, open-locating-dominating sets ⋮ Identifying codes of degree 4 Cayley graphs over abelian groups ⋮ Optimal open-locating-dominating sets in infinite triangular grids
This page was built for publication: Exact Minimum Density of Codes Identifying Vertices in the Square Grid
