Tero Laihonen
terolai@utu.fi +358 29 450 4303 +358 46 923 7614 Vesilinnantie 5 Turku ORCID identifier: https://orcid.org/0000-0002-2688-2166(external) |
Areas of expertise
Coding theory and graph theory
Coding theory and graph theory
Research
Research interests: Information retrieval in advanced memory systems and error-correcting codes, metric dimension in graphs, locating-dominating set, identifying codes
Publications 
2 of 5
- On Stronger Types of Locating-Dominating Codes (2019)
- Discrete Mathematics and Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - On t-revealing codes in binary Hamming spaces (2019)
- Information and Computation
(A1 Refereed original research article in a scientific journal) - Optimal bounds on codes for location in circulant graphs (2019)
- Cryptography and Communications
(A1 Refereed original research article in a scientific journal) - Solving Two Conjectures regarding Codes for Location in Circulant Graphs (2019)
- Discrete Mathematics and Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - The Levenshtein's Channel and the List Size in Information Retrieval (2019)
- IEEE International Symposium on Information Theory
(A4 Refereed article in a conference publication ) - On {l}-Metric Dimensions in Graphs (2018)
- Fundamenta Informaticae
(A1 Refereed original research article in a scientific journal) - On regular and new types of codes for location-domination (2018)
- Discrete Applied Mathematics
(A1 Refereed original research article in a scientific journal) - Improved codes for list decoding in the Levenshtein's channel and information retrieval (2017) Proceedings of 2017 IEEE International Symposium on Information Theory (ISIT) Laihonen T., Lehtilä T.
(A4 Refereed article in a conference publication ) - Information retrieval and the average number of input clues (2017)
- Advances in Mathematics of Communications
(A1 Refereed original research article in a scientific journal) - Location in circulant graphs (2017)
- TUCS Lecture Notes
(A4 Refereed article in a conference publication ) - On resolving several objects in the king grid (2017)
- TUCS Lecture Notes
(A4 Refereed article in a conference publication ) - Two New Classes of Locating-Dominating Codes (2017)
- TUCS Lecture Notes
(A4 Refereed article in a conference publication ) - Information Retrieval With Varying Number of Input Clues (2016)
- IEEE Transactions on Information Theory
(A1 Refereed original research article in a scientific journal) - Minimum Number of Input Clues in Robust Information Retrieval (2016)
- Fundamenta Informaticae
(A1 Refereed original research article in a scientific journal) - The metric dimension for resolving several objects (2016)
- Information Processing Letters
(A1 Refereed original research article in a scientific journal) - Information retrieval with unambiguous output (2015)
- Information and Computation
(A1 Refereed original research article in a scientific journal) - An improved lower bound for (1,≤2)-identifying codes in the king grid (2014)
- Advances in Mathematics of Communications
(A1 Refereed original research article in a scientific journal) - Codes for Information Retrieval With Small Uncertainty (2014)
- IEEE Transactions on Information Theory
(A1 Refereed original research article in a scientific journal) - Graphs where every k-subset of vertices is an identifying set (2014)
- Discrete Mathematics and Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - Optimal identification of sets of edges using 2-factors (2013)
- Discrete Mathematics
(A1 Refereed original research article in a scientific journal)
UTU Research Portal