Upper bounds for binary identifying codes
DOI10.1016/J.AAM.2008.06.004zbMATH Open1182.94067OpenAlexW2094789861MaRDI QIDQ1012154FDOQ1012154
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
Recommendations
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)
Cites Work
- On a new class of codes for identifying vertices in graphs
- Title not available (Why is that?)
- New identifying codes in the binary Hamming space
- Title not available (Why is that?)
- Title not available (Why is that?)
- The d-Identifying Codes Problem for Vertex Identification in Graphs: Probabilistic Analysis and an Approximation Algorithm
- Title not available (Why is that?)
- Construction of codes identifying sets of vertices
- Sequences of optimal identifying codes
- Codes identifying sets of vertices in random networks
- Extremal cardinalities for identifying and locating-dominating codes in graphs
- Locating vertices using codes
- Improved Upper Bounds on Binary Identifying Codes
- Title not available (Why is that?)
- Bounds on identifying codes
- Locating sensors in paths and cycles: the case of 2-identifying codes
- New bounds on binary identifying codes
Cited In (17)
- Title not available (Why is that?)
- On identifying codes in binary Hamming spaces
- Title not available (Why is that?)
- Bounds on identifying codes
- Improved bounds on identifying codes in binary Hamming spaces
- Identifying codes and searching with balls in graphs
- On the size of identifying codes in binary hypercubes
- On Iiro Honkala's contributions to identifying codes
- New bounds on binary identifying codes
- Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code
- Partial linear spaces and identifying codes
- Constructions of \(r\)-identifying codes and \((r, \leq l)\)-identifying codes
- Locating-Domination and Identification
- Sphere coverings and identifying codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Huge Size Codes for Identification Via a Multiple Access Channel Under a Word-Length Constraint
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)
