Pages that link to "Item:Q5947251"
From MaRDI portal
The following pages link to On codes identifying sets of vertices in Hamming spaces (Q5947251):
Displaying 16 items.
- Optimal identification of sets of edges using 2-factors (Q389983) (← links)
- Extension of universal cycles for globally identifying colorings of cycles (Q526222) (← links)
- Identification in \(\mathbb Z^2\) using Euclidean balls (Q628317) (← links)
- On identifying codes in binary Hamming spaces (Q696908) (← links)
- Various bounds for liar's domination number (Q726641) (← links)
- Constructing codes identifying sets of vertices (Q851780) (← links)
- New bounds on binary identifying codes (Q947104) (← links)
- Adaptive identification in graphs (Q958720) (← links)
- Improved bounds on identifying codes in binary Hamming spaces (Q966138) (← links)
- On the size of identifying codes in binary hypercubes (Q1024996) (← links)
- Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori (Q1406036) (← links)
- Optimal codes for strong identification (Q1612759) (← links)
- Families of optimal codes for strong identification (Q1613402) (← links)
- Paths and cycles identifying vertices in twisted cubes (Q1636884) (← links)
- Constructions of \(r\)-identifying codes and \((r, \leq l)\)-identifying codes (Q2283219) (← links)
- (Q2741420) (← links)
