Pages that link to "Item:Q966138"
From MaRDI portal
The following pages link to Improved bounds on identifying codes in binary Hamming spaces (Q966138):
Displaying 15 items.
- On binary linear \(r\)-identifying codes (Q540477) (← links)
- Partial linear spaces and identifying codes (Q627920) (← links)
- On the size of identifying codes in binary hypercubes (Q1024996) (← links)
- Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code (Q2042600) (← links)
- Optimal identifying codes of two families of Cayley graphs (Q2166227) (← links)
- Locating and identifying codes in circulant graphs (Q2244371) (← 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)
- Identifying codes of corona product graphs (Q2449061) (← 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)
- On Iiro Honkala's contributions to identifying codes (Q6614534) (← links)
