Pages that link to "Item:Q4674500"
From MaRDI portal
The following pages link to Two families of optimal identifying codes in binary Hamming spaces (Q4674500):
Displaying 12 items.
- On the size of identifying codes in triangle-free graphs (Q427898) (← links)
- On identifying codes in binary Hamming spaces (Q696908) (← links)
- On a new class of identifying codes in graphs (Q845971) (← links)
- Constructing codes identifying sets of vertices (Q851780) (← links)
- Codes identifying sets of vertices in random networks (Q870971) (← links)
- New bounds on binary identifying codes (Q947104) (← 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)
- (Q2741420) (← links)
- Liar's domination (Q3057104) (← links)