On codes identifying vertices in the two-dimensional square lattice with diagonals

IEEE Transactions on Computers

Volumn 50, Issue 2, 2001, Pages 174-176

  Cohen, Geérard D ^a,c   Honkala, Iiro ^b,c   Lobstein, Antoine ^a   Zeémor, Gilles ^a  

^a CNRS   (France)

^b UNIVERSITY OF TURKU   (Finland)

^c IEEE   (United States)

Author keywords

Code; Graph; Identifying code; Square lattice

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; GRAPH THEORY; INFORMATION THEORY; THEOREM PROVING;

IDENTIFYING CODE; SQUARE LATTICE; UNDIRECTED GRAPH;

MULTIPROCESSING SYSTEMS;

EID: 0035248745     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.908992     Document Type: Article

References (10)

1. Bounds on identifying codes
2. On binary codes for identification
3. Improved identifying codes for the grid
4. New bounds for codes identifying verticles in graphs
5. On identifying codes
6. Bounds for codes identifying vertices in the hexagonal grid
7. On a new class of codes for identifying vertices in graphs
8. On the covering of vertices for fault diagnosis in hypercubes
9. Locating dominating sets and locating-dominating sets