Pages that link to "Item:Q966160"
From MaRDI portal
The following pages link to New identifying codes in the binary Hamming space (Q966160):
Displaying 16 items.
- More results on the complexity of identifying problems in graphs (Q264560) (← links)
- On binary linear \(r\)-identifying codes (Q540477) (← links)
- Partial linear spaces and identifying codes (Q627920) (← links)
- Improved bounds on identifying codes in binary Hamming spaces (Q966138) (← links)
- Upper bounds for binary identifying codes (Q1012154) (← links)
- On regular and new types of codes for location-domination (Q1671339) (← links)
- Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code (Q2042600) (← links)
- Improved lower bound for locating-dominating codes in binary Hamming spaces (Q2068380) (← links)
- Constructions of \(r\)-identifying codes and \((r, \leq l)\)-identifying codes (Q2283219) (← links)
- Identifying codes and searching with balls in graphs (Q2355743) (← links)
- New results on variants of covering codes in Sierpiński graphs (Q2391669) (← links)
- Locating and identifying codes in circulant networks (Q2446842) (← 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)
- Identifying Codes in Line Graphs (Q5325952) (← links)
