Pages that link to "Item:Q696908"
From MaRDI portal
The following pages link to On identifying codes in binary Hamming spaces (Q696908):
Displaying 23 items.
- More results on the complexity of identifying problems in graphs (Q264560) (← links)
- On binary linear \(r\)-identifying codes (Q540477) (← links)
- A family of optimal identifying codes in \(\mathbb Z^2\) (Q855875) (← links)
- Identifying codes in vertex-transitive graphs and strongly regular graphs (Q888612) (← links)
- Adaptive identification in graphs (Q958720) (← links)
- New identifying codes in the binary Hamming space (Q966160) (← links)
- On the size of identifying codes in binary hypercubes (Q1024996) (← links)
- Identifying codes in the direct product of a complete graph and some special graphs (Q1720324) (← links)
- On identification in the triangular grid (Q1826954) (← links)
- Locating and identifying codes in dihedral graphs (Q2060210) (← links)
- Optimal identifying codes of two families of Cayley graphs (Q2166227) (← links)
- Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes (Q2186954) (← links)
- New results of identifying codes in product graphs (Q2245049) (← links)
- On \(t\)-revealing codes in binary Hamming spaces (Q2272993) (← links)
- On two variations of identifying codes (Q2275454) (← links)
- On identifying codes that are robust against edge changes (Q2373878) (← links)
- On minimum identifying codes in some Cartesian product graphs (Q2409538) (← links)
- Sphere coverings and identifying codes (Q2436572) (← links)
- Identifying codes of the direct product of two cliques (Q2441624) (← links)
- Locating and identifying codes in circulant networks (Q2446842) (← links)
- Identifying codes of corona product graphs (Q2449061) (← links)
- Monotonicity of the minimum cardinality of an identifying code in the hypercube (Q2492191) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
