Tero Laihonen
terolai@utu.fi +358 29 450 4303 +358 46 923 7614 Vesilinnantie 5 Turku |
Coding theory and graph theory
Research interests: Information retrieval in advanced memory systems and error-correcting codes, metric dimension in graphs, locating-dominating set, identifying codes
4 of 5
- On cages admitting identifying codes (2008)
- European Journal of Combinatorics
- On identifying codes in the king grid that are robust against edge deletions (2008)
- The Electronic Journal of Combinatorics
- Improved identifying codes in F-2(n) (2007) Exoo G, Laihonen T, Ranto S
- Improved identifying codes in F-2(n) (2007) Exoo G, Laihonen T, Ranto S
- Improved upper bounds on binary identifying codes (2007)
- IEEE Transactions on Information Theory
- On a new class of identifying codes in graphs (2007)
- Information Processing Letters
- On identifying codes that are robust against edge changes (2007)
- Information and Computation
- On identifying codes that are robust against edge changes (2007)
- Information and Computation
- On locating-dominating sets in infinite grids (2006)
- European Journal of Combinatorics
- On robust identification in the square and king grids (2006)
- Discrete Applied Mathematics
- Optimal t-edge-robust r-identifying codes in the king lattice (2006)
- Graphs and Combinatorics
- On optimal edge-robust and vertex-robust (1,<= l)-identifying codes (2005)
- Siam Journal on Discrete Mathematics
- On identification in the triangular grid (2004)
- Journal of Combinatorial Theory, Series B
- On identifying codes in the hexagonal mesh (2004)
- Information Processing Letters
- On identifying codes in the triangular and square grids (2004)
- SIAM Journal on Computing
- On locating-dominating codes in binary Hamming spaces (2004) Honkala I, Laihonen T, Ranto S
- Codes for identification in the king lattice (2003)
- Graphs and Combinatorics
- On the identification of sets of points in the square lattice (2003)
- Discrete and Computational Geometry
- Families of optimal codes for strong identification (2002)
- Discrete Applied Mathematics
- Families of optimal codes for strong identification (2002)
- Discrete Applied Mathematics
UTU Research Portal