Upper bounds for binary identifying codes

DOI10.1016/j.aam.2008.06.004zbMath1182.94067OpenAlexW2094789861MaRDI QIDQ1012154

Tero Laihonen, Ville Junnila, Sanna Ranto, Geoffrey Exoo

Publication date: 14 April 2009

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

Full work available at URL: https://doi.org/10.1016/j.aam.2008.06.004

zbMATH Keywords

Hamming spaceidentifying codesdirect sumlocating-dominating codes

Mathematics Subject Classification ID

Bounds on codes (94B65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fault detection; testing in circuits and networks (94C12)

Related Items (6)

Partial linear spaces and identifying codes ⋮ Sphere coverings and identifying codes ⋮ Constructions of \(r\)-identifying codes and \((r, \leq l)\)-identifying codes ⋮ Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code ⋮ Locating-Domination and Identification ⋮ Identifying codes and searching with balls in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal cardinalities for identifying and locating-dominating codes in graphs
• Codes identifying sets of vertices in random networks
• New bounds on binary identifying codes
• New identifying codes in the binary Hamming space
• Construction of codes identifying sets of vertices
• Locating sensors in paths and cycles: the case of 2-identifying codes
• Improved Upper Bounds on Binary Identifying Codes
• The d-Identifying Codes Problem for Vertex Identification in Graphs: Probabilistic Analysis and an Approximation Algorithm
• On a new class of codes for identifying vertices in graphs
• Sequences of optimal identifying codes
• Bounds on identifying codes

This page was built for publication: Upper bounds for binary identifying codes