On Optimal Edge-Robust and Vertex-Robust (1,\leq l)-Identifying Codes

DOI10.1137/S0895480104440754MaRDI QIDQ5317591zbMATH OpenOpenAlexFDO

Authors Tero Laihonen

Publication date 16 September 2005

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480104440754

zbMATH Keywords

Hamming spacesmultiple coveringmultiprocessor systemoptimal identifying codes

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Bounds on codes (94B65) Fault detection; testing in circuits and networks (94C12)

Recommendations

• scientific article; zbMATH DE number 5228468
• Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice
• An optimal edge-robust identifying code in the triangular lattice
• On identifying codes that are robust against edge changes
• On vertex-robust identifying codes of level three.
• New bounds for codes identifying vertices in graphs
• On 2-edge robust \(r\)-identifying codes in the king grid
• On a new class of codes for identifying vertices in graphs
• The d-Identifying Codes Problem for Vertex Identification in Graphs: Probabilistic Analysis and an Approximation Algorithm
• Maximum difference about the size of optimal identifying codes in graphs differing by one vertex

Cited in

(6)

• On identifying codes that are robust against edge changes
• Vertex identifying codes for fault isolation in communication networks
• Two families of optimal identifying codes in binary Hamming spaces
• scientific article; zbMATH DE number 5228468 (Why is no real title available?)
• On Iiro Honkala's contributions to identifying codes
• On robust identification in the square and King grids

This page was built for publication: On Optimal Edge-Robust and Vertex-Robust $(1,\leq l)$-Identifying Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317591)