Constructing codes identifying sets of vertices

DOI10.1007/s10623-006-0029-zzbMath1200.94062OpenAlexW1968688591MaRDI QIDQ851780

Julien Moncel

Publication date: 22 November 2006

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-006-0029-z

zbMATH Keywords

Fault detectionCode constructionIdentifying codes

Mathematics Subject Classification ID

Applications of graph theory (05C90) Fault detection; testing in circuits and networks (94C12) Other types of codes (94B60)

Related Items (2)

Optimal identification of sets of edges using 2-factors ⋮ Watching systems in graphs: an extension of identifying codes

Cites Work

• Codes identifying sets of vertices in random networks
• 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: Constructing codes identifying sets of vertices