Pages that link to "Item:Q1012154"
From MaRDI portal
The following pages link to Upper bounds for binary identifying codes (Q1012154):
Displaying 17 items.
- On binary linear \(r\)-identifying codes (Q540477) (← links)
- Partial linear spaces and identifying codes (Q627920) (← links)
- On identifying codes in binary Hamming spaces (Q696908) (← links)
- New bounds on binary identifying codes (Q947104) (← links)
- Improved bounds on identifying codes in binary Hamming spaces (Q966138) (← links)
- New identifying codes in the binary Hamming space (Q966160) (← links)
- On the size of identifying codes in binary hypercubes (Q1024996) (← links)
- On a conjecture regarding identification in Hamming graphs (Q2001977) (← links)
- Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code (Q2042600) (← links)
- Constructions of \(r\)-identifying codes and \((r, \leq l)\)-identifying codes (Q2283219) (← links)
- Identifying codes and searching with balls in graphs (Q2355743) (← links)
- Sphere coverings and identifying codes (Q2436572) (← links)
- (Q3115648) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Huge Size Codes for Identification Via a Multiple Access Channel Under a Word-Length Constraint (Q5504188) (← links)
- (Q5878174) (← links)
- On Iiro Honkala's contributions to identifying codes (Q6614534) (← links)