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
2 of 5
- On Stronger Types of Locating-Dominating Codes (2019)
- Discrete Mathematics and Theoretical Computer Science
- On t-revealing codes in binary Hamming spaces (2019)
- Information and Computation
- Optimal bounds on codes for location in circulant graphs (2019)
- Cryptography and Communications
- Solving Two Conjectures regarding Codes for Location in Circulant Graphs (2019)
- Discrete Mathematics and Theoretical Computer Science
- The Levenshtein's Channel and the List Size in Information Retrieval (2019)
- IEEE International Symposium on Information Theory
- On {l}-Metric Dimensions in Graphs (2018)
- Fundamenta Informaticae
- On regular and new types of codes for location-domination (2018)
- Discrete Applied Mathematics
- 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.
- Information retrieval and the average number of input clues (2017)
- Advances in Mathematics of Communications
- Location in circulant graphs (2017)
- TUCS Lecture Notes
- On resolving several objects in the king grid (2017)
- TUCS Lecture Notes
- Two New Classes of Locating-Dominating Codes (2017)
- TUCS Lecture Notes
- Information Retrieval With Varying Number of Input Clues (2016)
- IEEE Transactions on Information Theory
- Minimum Number of Input Clues in Robust Information Retrieval (2016)
- Fundamenta Informaticae
- The metric dimension for resolving several objects (2016)
- Information Processing Letters
- Information retrieval with unambiguous output (2015)
- Information and Computation
- An improved lower bound for (1,≤2)-identifying codes in the king grid (2014)
- Advances in Mathematics of Communications
- Codes for Information Retrieval With Small Uncertainty (2014)
- IEEE Transactions on Information Theory
- Graphs where every k-subset of vertices is an identifying set (2014)
- Discrete Mathematics and Theoretical Computer Science
- Optimal identification of sets of edges using 2-factors (2013)
- Discrete Mathematics
UTU Research Portal