On robust identification in the square and king grids

Authors:
Tero Laihonen
Affiliations:
Department of Mathematics, University of Turku, Turku, Finland
Venue:
Discrete Applied Mathematics
Year:
2006

Citing 13
Cited 1

On Codes Identifying Vertices in the Two-Dimensional Square Lattice with Diagonals

IEEE Transactions on Computers
Bounds for Codes Identifying Vertices in the Hexagonal Grid

SIAM Journal on Discrete Mathematics
Bounds on identifying codes

Discrete Mathematics
Optimal codes for strong identification

European Journal of Combinatorics
On the density of identifying codes in the square lattice

Journal of Combinatorial Theory Series B
On Identifying Codes in the Triangular and Square Grids

SIAM Journal on Computing
On identification in the triangular grid

Journal of Combinatorial Theory Series B
On Optimal Edge-Robust and Vertex-Robust $(1,\leq l)$-Identifying Codes

SIAM Journal on Discrete Mathematics
Exact Minimum Density of Codes Identifying Vertices in the Square Grid

SIAM Journal on Discrete Mathematics
On a new class of identifying codes in graphs

Information Processing Letters
On a new class of codes for identifying vertices in graphs

IEEE Transactions on Information Theory
Sequences of optimal identifying codes

IEEE Transactions on Information Theory
On robust and dynamic identifying codes

IEEE Transactions on Information Theory

On identifying codes that are robust against edge changes

Information and Computation

Quantified Score

Hi-index	0.04

Visualization

Abstract

Fault diagnosis of multiprocessor systems gives the motivation for robust identifying codes. We provide robust identifying codes for the square and king grids. Often we are able to find optimal such codes.