An improved lower bound for \((1,\leq 2)\)-identifying codes in the king grid

DOI10.3934/amc.2014.8.35zbMath1283.05201arXiv1111.2477OpenAlexW3100771338MaRDI QIDQ2437959

Aline Parreau, Tero Laihonen, Florent Foucaud

Publication date: 10 March 2014

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.2477

zbMATH Keywords

densityidentifying codesdischarging methodking grid

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Other types of codes (94B60) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

The metric dimension for resolving several objects ⋮ Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid ⋮ Locating-Domination and Identification

Cites Work

• On identifying codes in the hexagonal mesh
• The minimum density of an identifying code in the king lattice.
• Codes for identification in the king lattice
• On identification in the triangular grid
• A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid
• New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid
• Bounds for Codes Identifying Vertices in the Hexagonal Grid
• On codes identifying vertices in the two-dimensional square lattice with diagonals
• On a new class of codes for identifying vertices in graphs
• On Identifying Codes in the Triangular and Square Grids
• Exact Minimum Density of Codes Identifying Vertices in the Square Grid
• Identifying codes with small radius in some infinite regular graphs

This page was built for publication: An improved lower bound for \((1,\leq 2)\)-identifying codes in the king grid