Defines local identifying and locating-dominating codes and establishes asymptotically tight bounds for optimal sizes in binary hypercubes plus optimal densities for seven of eight grid constructions.
New bounds on the minimum density of an identifying code for the infinite hexagonal grid
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
New upper bound of 53/126 for the minimum density of identifying codes on the infinite hexagonal grid.
The paper surveys Iiro Honkala's contributions to identifying codes across complexity, combinatorics, grids, graph parameters, structural properties, and optimal code counts.
citing papers explorer
-
Optimal local identifying and local locating-dominating codes
Defines local identifying and locating-dominating codes and establishes asymptotically tight bounds for optimal sizes in binary hypercubes plus optimal densities for seven of eight grid constructions.
-
Finding codes on infinite grids automatically
New upper bound of 53/126 for the minimum density of identifying codes on the infinite hexagonal grid.
-
On Iiro Honkala's contributions to identifying codes
The paper surveys Iiro Honkala's contributions to identifying codes across complexity, combinatorics, grids, graph parameters, structural properties, and optimal code counts.