The following pages link to Bounds on identifying codes (Q5951931):
Displaying 32 items.
- On binary linear \(r\)-identifying codes (Q540477) (← links)
- Open neighborhood locating-dominating in trees (Q628345) (← links)
- Identifying codes and locating-dominating sets on paths and cycles (Q642979) (← links)
- On identifying codes in binary Hamming spaces (Q696908) (← 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)
- New identifying codes in the binary Hamming space (Q966160) (← links)
- Upper bounds for binary identifying codes (Q1012154) (← links)
- On \(r\)-locating-dominating sets in paths (Q1024298) (← 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)
- The minimum density of an identifying code in the king lattice. (Q1422415) (← links)
- Optimal codes for strong identification (Q1612759) (← links)
- Paths and cycles identifying vertices in twisted cubes (Q1636884) (← links)
- A class of I.P.P. codes with efficient identification (Q1827562) (← links)
- On the density of identifying codes in the square lattice (Q1850615) (← links)
- Locating and identifying codes in circulant networks (Q2446842) (← links)
- Locating sensors in paths and cycles: the case of 2-identifying codes (Q2462318) (← links)
- Identifying codes of cycles (Q2488842) (← links)
- Monotonicity of the minimum cardinality of an identifying code in the hypercube (Q2492191) (← links)
- Codes for strong identification (Q2741420) (← links)
- Edge identifying codes (Q2857369) (← links)
- Liar's domination (Q3057104) (← links)
- On robust and dynamic identifying codes (Q3547044) (← links)
- r-Identifying codes in binary Hamming space, q-ary Lee space and incomplete hypercube (Q4634300) (← links)
- Links Between Discriminating and Identifying Codes in the Binary Hamming Space (Q5386104) (← 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)
- Optimal local identifying and local locating-dominating codes (Q6614544) (← links)
