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 binary identif ying codes
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DM 2verdicts
UNVERDICTED 2representative citing papers
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.
-
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.