Improved Upper Bounds on Binary Identifying Codes
From MaRDI portal
Publication:3549076
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)