Upper bounds for binary identifying codes

DOI10.1016/J.AAM.2008.06.004MaRDI QIDQ1012154zbMATH OpenOpenAlexFDO

Authors Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna Ranto

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

identifying codesHamming spacedirect sumlocating-dominating codes

Mathematics Subject Classification ID

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

Recommendations

• On identifying codes in binary Hamming spaces
• Improved bounds on identifying codes in binary Hamming spaces
• Bounds on identifying codes
• New bounds on binary identifying codes
• New identifying codes in the binary Hamming space

Cites work

• scientific article; zbMATH DE number 4053685 (Why is no real title available?)
• scientific article; zbMATH DE number 4070954 (Why is no real title available?)
• scientific article; zbMATH DE number 1024657 (Why is no real title available?)
• scientific article; zbMATH DE number 1522566 (Why is no real title available?)
• scientific article; zbMATH DE number 1436153 (Why is no real title available?)
• Bounds on identifying codes
• Codes identifying sets of vertices in random networks
• Construction of codes identifying sets of vertices
• Extremal cardinalities for identifying and locating-dominating codes in graphs
• Improved Upper Bounds on Binary Identifying Codes
• Locating sensors in paths and cycles: the case of 2-identifying codes
• Locating vertices using codes
• New bounds on binary identifying codes
• New identifying codes in the binary Hamming space
• On a new class of codes for identifying vertices in graphs
• Sequences of optimal identifying codes
• The d-Identifying Codes Problem for Vertex Identification in Graphs: Probabilistic Analysis and an Approximation Algorithm

Cited in

(20)

• Locating-domination and identification
• New identifying codes in the binary Hamming space
• On identifying codes in binary Hamming spaces
• Partial linear spaces and identifying codes
• Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code
• Sphere coverings and identifying codes
• Identifying codes and searching with balls in graphs
• scientific article; zbMATH DE number 1504659 (Why is no real title available?)
• On Iiro Honkala's contributions to identifying codes
• scientific article; zbMATH DE number 1522566 (Why is no real title available?)
• On the size of identifying codes in binary hypercubes
• scientific article; zbMATH DE number 7655282 (Why is no real title available?)
• New bounds on binary identifying codes
• Huge Size Codes for Identification Via a Multiple Access Channel Under a Word-Length Constraint
• Bounds on identifying codes
• On a conjecture regarding identification in Hamming graphs
• Improved bounds on identifying codes in binary Hamming spaces
• scientific article; zbMATH DE number 6004916 (Why is no real title available?)
• Constructions of \(r\)-identifying codes and \((r, \leq l)\)-identifying codes
• On binary linear \(r\)-identifying codes

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

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