New bounds for (r, 2)-identifying codes in the infinite king grid

DOI10.1007/S12095-009-0015-1MaRDI QIDQ2380847zbMATH OpenOpenAlexFDO

Authors Mikko Pelto

Publication date 12 April 2010

Published in Cryptography and Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12095-009-0015-1

zbMATH Keywords

densitygraphidentifying codeking grid

Mathematics Subject Classification ID

Applications of graph theory (05C90) Other types of codes (94B60)

Recommendations

• An improved lower bound for \((1,\leq 2)\)-identifying codes in the king grid
• On \((r,\leq 2)\)-locating-dominating codes in the infinite King grid
• On 2-edge robust \(r\)-identifying codes in the king grid
• Lower bounds for identifying codes in some infinite grids
• Optimal identifying codes in the infinite 3-dimensional king grid
• New bounds on the minimum density of an identifying code for the infinite hexagonal grid
• Minimum density of identifying codes of king grids
• Minimum density of identifying codes of king grids
• Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid
• New lower bound for 2-identifying code in the square grid

Cites work

• Codes for identification in the king lattice
• Identifying codes with small radius in some infinite regular graphs
• On a new class of codes for identifying vertices in graphs
• On a new class of identifying codes in graphs
• On codes identifying vertices in the two-dimensional square lattice with diagonals
• On Identifying Codes in the Triangular and Square Grids
• The minimum density of an identifying code in the king lattice.

Cited in

(15)

• On identifying codes in the King grid that are robust against edge deletions
• Codes for identification in the king lattice
• Lower bounds for identifying codes in some infinite grids
• An improved lower bound for \((1,\leq 2)\)-identifying codes in the king grid
• Optimal identifying codes in the infinite 3-dimensional king grid
• Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid
• New lower bound for 2-identifying code in the square grid
• On locating-dominating codes in the infinite king grid.
• Improved Bounds forr-Identifying Codes of the Hex Grid
• Locating-domination and identification
• On 2-edge robust \(r\)-identifying codes in the king grid
• On \((r,\leq 2)\)-locating-dominating codes in the infinite King grid
• Minimum density of identifying codes of king grids
• On Iiro Honkala's contributions to identifying codes
• Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice

This page was built for publication: New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380847)