The following pages link to Iiro S. Honkala (Q1261013):
Displaying 50 items.
- (Q188597) (redirect page) (← links)
- (Q221605) (redirect page) (← links)
- On the ensemble of optimal identifying codes in a twin-free graph (Q267807) (← links)
- Locally identifying colourings for graphs with given maximum degree (Q418899) (← links)
- On the number of optimal identifying codes in a twin-free graph (Q476309) (← links)
- A Graham-Sloane type construction for \(s\)-surjective matrices (Q685994) (← links)
- On identifying codes in binary Hamming spaces (Q696908) (← links)
- Weighted codes in Lee metrics (Q735023) (← links)
- On locating--dominating sets in infinite grids (Q819007) (← links)
- On a new class of identifying codes in graphs (Q845971) (← links)
- A family of optimal identifying codes in \(\mathbb Z^2\) (Q855875) (← links)
- Structural properties of twin-free graphs (Q870075) (← links)
- An optimal strongly identifying code in the infinite triangular grid (Q986692) (← links)
- On identifying codes in the King grid that are robust against edge deletions (Q1010708) (← links)
- On \(r\)-locating-dominating sets in paths (Q1024298) (← links)
- On identifying codes in the hexagonal mesh (Q1029036) (← links)
- A modification of the Zinoviev lower bound for constant weight codes (Q1070995) (← links)
- Some lower bounds for constant weight codes (Q1096589) (← links)
- All binary codes with covering radius one are subnormal (Q1182971) (← links)
- On lengthening of covering codes (Q1199613) (← links)
- Bounds for binary multiple covering codes (Q1261015) (← links)
- New bounds for codes identifying vertices in graphs (Q1283874) (← links)
- On the normality of multiple covering codes (Q1322275) (← links)
- On \((p,1)\)-subnormal \(q\)-ary covering codes (Q1331896) (← links)
- Long binary narrow-sense BCH codes are normal (Q1352424) (← links)
- On covering radius and discrete Chebyshev polynomials (Q1360991) (← links)
- On the complexity of the identification problem in Hamming spaces (Q1403334) (← links)
- Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori (Q1406036) (← links)
- The minimum density of an identifying code in the king lattice. (Q1422415) (← links)
- Codes for identification in the king lattice (Q1423495) (← links)
- On strongly identifying codes (Q1613540) (← links)
- On identification in the triangular grid (Q1826954) (← links)
- On the density of identifying codes in the square lattice (Q1850615) (← links)
- On the identification of sets of points in the square lattice (Q1864133) (← links)
- An optimal edge-robust identifying code in the triangular lattice (Q1890400) (← links)
- Minimum sizes of identifying codes in graphs differing by one edge (Q2016394) (← links)
- Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs (Q2268243) (← links)
- Erratum to ``Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs''. (Q2268675) (← links)
- On the ensemble of optimal dominating and locating-dominating codes in a graph (Q2346565) (← links)
- On identifying codes that are robust against edge changes (Q2373878) (← links)
- Watching systems in the King grid (Q2376080) (← links)
- Minimum sizes of identifying codes in graphs differing by one vertex (Q2392684) (← links)
- An optimal locating-dominating set in the infinite triangular grid (Q2433724) (← links)
- Bounds for Codes Identifying Vertices in the Hexagonal Grid (Q2706181) (← links)
- (Q2713644) (← links)
- (Q2717197) (← links)
- (Q2741420) (← links)
- On the probability of undetected error for binary codes used for combined correction and detection (Q2782316) (← links)
- Multicovering Bounds from Relative Covering Radii (Q2784513) (← links)
- Weighted perfect codes in Lee metric (Q2851506) (← links)
