Families of optimal codes for strong identification

DOI10.1016/S0166-218X(01)00248-7zbMath1005.94031MaRDI QIDQ1613402

Sanna Ranto, Tero Laihonen

Publication date: 29 August 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

lower boundsHamming spaceoptimal strongly identifying codes

Mathematics Subject Classification ID

Fault detection; testing in circuits and networks (94C12) Other types of codes (94B60) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (8)

Optimal codes for strong identification ⋮ On identifying codes that are robust against edge changes ⋮ Paths and cycles identifying vertices in twisted cubes ⋮ Codes identifying sets of vertices in random networks ⋮ Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori ⋮ On identifying codes in binary Hamming spaces ⋮ Liar's domination ⋮ Locating-Domination and Identification

Cites Work

• Unnamed Item
• Unnamed Item
• On strongly identifying codes
• On a new class of codes for identifying vertices in graphs
• Two families of optimal identifying codes in binary Hamming spaces
• On codes identifying sets of vertices in Hamming spaces

This page was built for publication: Families of optimal codes for strong identification