Pages that link to "Item:Q1403334"
From MaRDI portal
The following pages link to On the complexity of the identification problem in Hamming spaces (Q1403334):
Displayed 8 items.
- More results on the complexity of identifying problems in graphs (Q264560) (← links)
- On identifying codes in binary Hamming spaces (Q696908) (← links)
- New identifying codes in the binary Hamming space (Q966160) (← links)
- On identification in the triangular grid (Q1826954) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- r-Identifying codes in binary Hamming space, q-ary Lee space and incomplete hypercube (Q4634300) (← links)
- Bounds on r-identifying codes in q-ary Lee space (Q4986273) (← links)
- Links Between Discriminating and Identifying Codes in the Binary Hamming Space (Q5386104) (← links)