Pages that link to "Item:Q947104"
From MaRDI portal
The following pages link to New bounds on binary identifying codes (Q947104):
Displayed 8 items.
- Identifying codes in vertex-transitive graphs and strongly regular graphs (Q888612) (← links)
- Improved bounds on identifying codes in binary Hamming spaces (Q966138) (← links)
- New identifying codes in the binary Hamming space (Q966160) (← links)
- Upper bounds for binary identifying codes (Q1012154) (← links)
- On the size of identifying codes in binary hypercubes (Q1024996) (← links)
- Constructions of \(r\)-identifying codes and \((r, \leq l)\)-identifying codes (Q2283219) (← links)
- Identifying codes and searching with balls in graphs (Q2355743) (← links)
- Locating-Domination and Identification (Q3384611) (← links)