Families of optimal codes for strong identification
From MaRDI portal
Publication:1613402
DOI10.1016/S0166-218X(01)00248-7zbMath1005.94031MaRDI QIDQ1613402
Publication date: 29 August 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
94C12: Fault detection; testing in circuits and networks
94B60: Other types of codes
68M15: Reliability, testing and fault tolerance of networks and computer systems
Related Items
On identifying codes in binary Hamming spaces, Codes identifying sets of vertices in random networks, Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori, Optimal codes for strong identification, Paths and cycles identifying vertices in twisted cubes, On identifying codes that are robust against edge changes, Liar's domination, Locating-Domination and Identification
Cites Work