Optimal codes for strong identification

DOI10.1006/eujc.2002.0571zbMath1011.94027OpenAlexW2077667712MaRDI QIDQ1612759

Tero Laihonen

Publication date: 19 May 2003

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/64c9a1c25ccb8db72880168c3b9294c7587b5856

zbMATH Keywords

fault detectionfaulty processorsstrongly identifying code

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) Combinatorial aspects of packing and covering (05B40)

Related Items

On identifying codes that are robust against edge changes, On robust identification in the square and King grids, On identifying codes in binary Hamming spaces, Locating-Domination and Identification

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Families of optimal codes for strong identification
• On strongly identifying codes
• On a new class of codes for identifying vertices in graphs
• Sequences of optimal identifying codes
• Two families of optimal identifying codes in binary Hamming spaces
• On codes identifying sets of vertices in Hamming spaces
• Bounds on identifying codes
• General bounds for identifying codes in some infinite regular graphs