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
- Optimal identification of sets of edges using 2-factors (2013)
- Discrete Mathematics
- Tolerant identification with Euclidean ballsNew lower bounds for identifying codes in infinite grids (2013)
- NetworksIEEE International Symposium on Information Theory
- Optimal Identifying Codes in Cycles and Paths (2012)
- IEEE International Symposium on Information TheoryEuropean Journal of Combinatorics
- Locally identifying colourings for graphs with given maximum degree (2012)
- Discrete Mathematics
- (2012)
- (2012)
- Graphs and Combinatorics
- Optimal lower bound for 2-identifying codes in the hexagonal grid (2012)
- The Electronic Journal of Combinatorics
- Identification in Z(2) using Euclidean ballsOn location-domination of set of vertices in cycles and pathsOn Vertex-Robust Identifying Codes of Level Three (2011)
- Discrete Applied MathematicsCongressus NumerantiumArs Combinatoria
- Locating-dominating codes in cyclesUpper bounds for binary identifying codes2011
- Australasian Journal of Combinatorics
- Locating-dominating codes in paths (2011)
- Discrete Mathematics
- Optimality of a 2-identifying code in the xexagonal gridLocating vertices using codes (2011) Junnila Ville, Laihonen Tero
- Improved bounds on identifying codes in binary Hamming spaces (2010)
- (2010)
- (2010)
- An Optimal Result for Codes Identifying Sets of Words (2009) Janson S, Laihonen T
- On the size of identifying codes in binary hypercubes (2009)
- Journal of Combinatorial Theory, Series A
- (2009)
- Advances in Applied Mathematics
- Upper bounds for binary identifying codes (2009)
- Advances in Applied Mathematics
- Improved Bounds on Binary Identifying Codes (2008) Exoo G, Junnila V, Laihonen T, Ranto S
- (2008)
- Congressus Numerantium