New identifying codes in the binary Hamming space
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1735664 (Why is no real title available?)
- scientific article; zbMATH DE number 1504659 (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
- Identifying codes with small radius in some infinite regular graphs
- Improved Upper Bounds on Binary Identifying Codes
- Monotonicity of the minimum cardinality of an identifying code in the hypercube
- New bounds on binary identifying codes
- On a new class of codes for identifying vertices in graphs
- On identifying codes in binary Hamming spaces
- On the complexity of the identification problem in Hamming spaces
- The noising methods: A generalization of some metaheuristics
Cited in
(26)- Bounds on \(r\)-identifying codes in \(q\)-ary Lee space
- Locating-domination and identification
- 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
- A novel maximum distance separable code to generate universal identifiers
- r-Identifying codes in binary Hamming space, q-ary Lee space and incomplete hypercube
- Links Between Discriminating and Identifying Codes in the Binary Hamming Space
- Identifying codes and searching with balls in graphs
- Identifying codes in \(q\)-ary hypercubes
- Identifying codes in line graphs
- On Iiro Honkala's contributions to identifying codes
- Optimal local identifying and local locating-dominating codes
- Locating and identifying codes in circulant networks
- On \(t\)-revealing codes in binary Hamming spaces
- On the complexity of the identification problem in Hamming spaces
- New bounds on binary identifying codes
- New results on variants of covering codes in Sierpiński graphs
- Bounds on identifying codes
- Upper bounds for binary identifying codes
- Improved lower bound for locating-dominating codes in binary Hamming spaces
- More results on the complexity of identifying problems in graphs
- On regular and new types of codes for location-domination
- Improved bounds on identifying codes in binary Hamming spaces
- Constructions of \(r\)-identifying codes and \((r, \leq l)\)-identifying codes
- On binary linear \(r\)-identifying codes
This page was built for publication: New identifying codes in the binary Hamming space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q966160)
