On the covering of vertices for fault diagnosis in hypercubes

DOI10.1016/S0020-0190(98)00199-9zbMath1339.68026OpenAlexW2071488310MaRDI QIDQ294624

Mark G. Karpovsky, Lev B. Levitin, Krishnendu Chakrabarty, Dimiter R. Avresky

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001999?np=y

zbMATH Keywords

distributed systemsfault tolerancemultiprocessorsfault diagnosiscoding theory

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Reliability, testing and fault tolerance of networks and computer systems (68M15) Combinatorial codes (94B25)

Related Items (9)

Unnamed Item ⋮ On minimum identifying codes in some Cartesian product graphs ⋮ Identifying codes of the direct product of two cliques ⋮ Identifying codes of corona product graphs ⋮ Ratewise-optimal non-sequential search strategies under constraints on the tests ⋮ New results of identifying codes in product graphs ⋮ Monotonicity of the minimum cardinality of an identifying code in the hypercube ⋮ Liar's domination ⋮ On the density of identifying codes in the square lattice

Cites Work

• Covering radius 1985-1994
• Covering radius---Survey and recent results
• Further results on the covering radius of codes
• On a new class of codes for identifying vertices in graphs
• Characterization of Connection Assignment of Diagnosable Systems
• Unnamed Item

This page was built for publication: On the covering of vertices for fault diagnosis in hypercubes