Pages that link to "Item:Q4544828"
From MaRDI portal
The following pages link to Sequences of optimal identifying codes (Q4544828):
Displaying 17 items.
- Optimal identification of sets of edges using 2-factors (Q389983) (← links)
- On identifying codes in binary Hamming spaces (Q696908) (← links)
- On a new class of identifying codes in graphs (Q845971) (← links)
- On robust identification in the square and King grids (Q860410) (← links)
- Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice (Q882790) (← links)
- New bounds on binary identifying codes (Q947104) (← links)
- Improved bounds on identifying codes in binary Hamming spaces (Q966138) (← links)
- Upper bounds for binary identifying codes (Q1012154) (← links)
- Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori (Q1406036) (← links)
- On the identification problems in products of cycles (Q1420607) (← links)
- Optimal codes for strong identification (Q1612759) (← links)
- Paths and cycles identifying vertices in twisted cubes (Q1636884) (← links)
- Constructions of \(r\)-identifying codes and \((r, \leq l)\)-identifying codes (Q2283219) (← links)
- On identifying codes that are robust against edge changes (Q2373878) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\) (Q6112225) (← links)
- On Iiro Honkala's contributions to identifying codes (Q6614534) (← links)
