Families of optimal codes for strong identification
From MaRDI portal
Publication:1613402
DOI10.1016/S0166-218X(01)00248-7zbMATH Open1005.94031MaRDI QIDQ1613402FDOQ1613402
Publication date: 29 August 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
Reliability, testing and fault tolerance of networks and computer systems (68M15) Fault detection; testing in circuits and networks (94C12) Other types of codes (94B60)
Cites Work
Cited In (16)
- Paths and cycles identifying vertices in twisted cubes
- Two families of optimal identifying codes in binary Hamming spaces
- Improved identification schemes based on error-correcting codes
- Codes identifying sets of vertices in random networks
- On identifying codes in binary Hamming spaces
- Liar's domination
- On robust and dynamic identifying codes
- Optimal codes for strong identification
- Codes for strong identification
- On Iiro Honkala's contributions to identifying codes
- Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
- Locating-Domination and Identification
- A class of I.P.P. codes with efficient identification
- On identifying codes that are robust against edge changes
- Title not available (Why is that?)
- Optimal linear identifying codes
This page was built for publication: Families of optimal codes for strong identification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1613402)
