scientific article; zbMATH DE number 5228468
From MaRDI portal
Publication:5437393
zbMATH Open1131.94026MaRDI QIDQ5437393FDOQ5437393
Publication date: 18 January 2008
Title of this publication is not available (Why is that?)
Recommendations
- On Optimal Edge-Robust and Vertex-Robust $(1,\leq l)$-Identifying Codes
- On identifying codes that are robust against edge changes
- Improved bounds on identifying codes in binary Hamming spaces
- On identifying codes in binary Hamming spaces
- An optimal edge-robust identifying code in the triangular lattice
- Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice
- \(r\)-identifying codes in binary Hamming space, \(q\)-ary Lee space and incomplete hypercube
- On binary linear \(r\)-identifying codes
- On 2-edge robust \(r\)-identifying codes in the king grid
- Links Between Discriminating and Identifying Codes in the Binary Hamming Space
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)
Cited In (6)
- On Optimal Edge-Robust and Vertex-Robust $(1,\leq l)$-Identifying Codes
- On robust identification in the square and King grids
- On Iiro Honkala's contributions to identifying codes
- Minimum sizes of identifying codes in graphs differing by one edge
- Minimum sizes of identifying codes in graphs differing by one vertex
- On identifying codes that are robust against edge changes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5437393)
