On Optimal Edge-Robust and Vertex-Robust $(1,\leq l)$-Identifying Codes
From MaRDI portal
Publication:5317591
DOI10.1137/S0895480104440754zbMath1114.94024OpenAlexW2065140219MaRDI QIDQ5317591
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
Bounds on codes (94B65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fault detection; testing in circuits and networks (94C12)
Related Items (2)
On identifying codes that are robust against edge changes ⋮ 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