Improved Upper Bounds on Binary Identifying Codes
From MaRDI portal
Publication:3549076
DOI10.1109/TIT.2007.907434zbMATH Open1326.94141MaRDI QIDQ3549076FDOQ3549076
Authors: Geoffrey Exoo, Tero Laihonen, Sanna Ranto 
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Combinatorics in computer science (68R05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Bounds on codes (94B65) Other types of codes (94B60)
Cited In (10)
- On binary linear \(r\)-identifying codes
- Improved bounds on identifying codes in binary Hamming spaces
- New identifying codes in the binary Hamming space
- Locating-dominating codes: bounds and extremal cardinalities
- Locating-domination and identification
- On Iiro Honkala's contributions to identifying codes
- New bounds on binary identifying codes
- Constructions of \(r\)-identifying codes and \((r, \leq l)\)-identifying codes
- Upper bounds for binary identifying codes
- Links Between Discriminating and Identifying Codes in the Binary Hamming Space
This page was built for publication: Improved Upper Bounds on Binary Identifying Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549076)
