Constructing codes identifying sets of vertices

DOI10.1007/S10623-006-0029-ZMaRDI QIDQ851780zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Construction of codes identifying sets of vertices
• On graphs admitting codes identifying sets of vertices
• Publication:4502621
• Bounds on identifying codes
• The minimum identifying code graphs

Cites work

• Codes identifying sets of vertices in random networks
• On a new class of codes for identifying vertices in graphs
• On codes identifying sets of vertices in Hamming spaces
• Two families of optimal identifying codes in binary Hamming spaces

Cited in

(9)

• An unexpected result in coding the vertices of a graph
• Construction of codes identifying sets of vertices
• On graphs having a \(V\setminus \{x\}\) set as an identifying code
• Tighter bounds on the independence number of the Birkhoff graph
• On graphs admitting codes identifying sets of vertices
• Optimal identification of sets of edges using 2-factors
• Watching systems in graphs: an extension of identifying codes
• scientific article; zbMATH DE number 1504659 (Why is no real title available?)
• Vertex identifying codes for the \(n\)-dimensional lattice

This page was built for publication: Constructing codes identifying sets of vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q851780)