Pages that link to "Item:Q947104"
From MaRDI portal
The following pages link to New bounds on binary identifying codes (Q947104):
Displaying 17 items.
- Extension of universal cycles for globally identifying colorings of cycles (Q526222) (← links)
- 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)
- Optimal codes for strong identification (Q1612759) (← links)
- On two variations of identifying codes (Q2275454) (← links)
- Constructions of \(r\)-identifying codes and \((r, \leq l)\)-identifying codes (Q2283219) (← links)
- A novel maximum distance separable code to generate universal identifiers (Q2325303) (← links)
- Identifying codes and searching with balls in graphs (Q2355743) (← links)
- New lower bound for 2-identifying code in the square grid (Q2446847) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- New results in binary multiple descriptions (Q3768802) (← links)
- Links Between Discriminating and Identifying Codes in the Binary Hamming Space (Q5386104) (← links)
- On Iiro Honkala's contributions to identifying codes (Q6614534) (← links)
- Optimal local identifying and local locating-dominating codes (Q6614544) (← links)