Tero Laihonen

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 30

Top Topics

Information Retrieval

Error Correction

Polynomial Approximation

Top Venues

IEEE Trans. Inf. Theory

Fundam. Informaticae

Publications

Anni Hakanen, Ville Junnila, Tero Laihonen, Ismael G. Yero
On the unicyclic graphs having vertices that belong to all their (strong) metric bases. Discret. Appl. Math. 353 (2024)
Vesa Halava, Jarkko Kari, Tero Laihonen
Preface. Fundam. Informaticae 191 (3-4) (2024)
Pyry Herva, Tero Laihonen, Tuomo Lehtilä
Optimal Local Identifying and Local Locating-dominating Codes. Fundam. Informaticae 191 (3-4) (2024)
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
On Unique Error Patterns in the Levenshtein's Sequence Reconstruction Model. CoRR (2024)
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
The Levenshtein's Sequence Reconstruction Problem and the Length of the List. IEEE Trans. Inf. Theory 70 (2) (2024)
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
Levenshtein's Reconstruction Problem with Different Error Patterns. ISIT (2023)
Anni Hakanen, Ville Junnila, Tero Laihonen, María Luz Puertas
On the metric dimensions for sets of vertices. Discuss. Math. Graph Theory 43 (1) (2023)
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
New Optimal Results on Codes for Location in Graphs. CoRR (2023)
Pyry Herva, Tero Laihonen, Tuomo Lehtilä
Optimal local identifying and local locating-dominating codes. CoRR (2023)
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
Improved lower bound for locating-dominating codes in binary Hamming spaces. Des. Codes Cryptogr. 90 (1) (2022)
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
On the List Size in the Levenshtein's Sequence Reconstruction Problem. ISIT (2022)
Anni Hakanen, Ville Junnila, Tero Laihonen, Ismael G. Yero
On vertices contained in all or in no metric basis. Discret. Appl. Math. 319 (2022)
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
The Levenshtein's Sequence Reconstruction Problem and the Length of the List. CoRR (2022)
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
On Levenshtein's Channel and List Size in Information Retrieval. IEEE Trans. Inf. Theory 67 (6) (2021)
Anni Hakanen, Ville Junnila, Tero Laihonen
The solid-metric dimension. Theor. Comput. Sci. 806 (2020)
Ville Junnila, Tero Laihonen
Tolerant location detection in sensor networks. Adv. Appl. Math. 112 (2020)
Ville Junnila, Tero Laihonen, Tuomo Lehtila, María Luz Puertas
On Stronger Types of Locating-dominating Codes. Discret. Math. Theor. Comput. Sci. 21 (1) (2019)
Ville Junnila, Tero Laihonen, Gabrielle Paris
Optimal bounds on codes for location in circulant graphs. Cryptogr. Commun. 11 (4) (2019)
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
On a Conjecture Regarding Identification in Hamming Graphs. Electron. J. Comb. 26 (2) (2019)
Ville Junnila, Tero Laihonen, Gabrielle Paris
Solving Two Conjectures regarding Codes for Location in Circulant Graphs. Discret. Math. Theor. Comput. Sci. 21 (3) (2019)
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
The Levenshtein's Channel and the List Size in Information Retrieval. ISIT (2019)
Tero Laihonen
-revealing codes in binary Hamming spaces. Inf. Comput. 268 (2019)
Ville Junnila, Tero Laihonen, Gabrielle Paris
Optimal bounds on codes for location in circulant graphs. CoRR (2018)
Ville Junnila, Tero Laihonen, Tuomo Lehtila
On regular and new types of codes for location-domination. Discret. Appl. Math. 247 (2018)
Anni Hakanen, Tero Laihonen
On {ℓ}-Metric Dimensions in Graphs. Fundam. Informaticae 162 (2-3) (2018)
Tero Laihonen, Tuomo Lehtila
Improved codes for list decoding in the Levenshtein's channel and information retrieval. ISIT (2017)
Tero Laihonen
Information retrieval and the average number of input clues. Adv. Math. Commun. 11 (1) (2017)
Tero Laihonen
The metric dimension for resolving several objects. Inf. Process. Lett. 116 (11) (2016)
Ville Junnila, Tero Laihonen
Information Retrieval With Varying Number of Input Clues. IEEE Trans. Inf. Theory 62 (2) (2016)
Ville Junnila, Tero Laihonen
Minimum Number of Input Clues in Robust Information Retrieval. Fundam. Informaticae 145 (3) (2016)
Ville Junnila, Tero Laihonen
Information retrieval with unambiguous output. Inf. Comput. 242 (2015)
Florent Foucaud, Tero Laihonen, Aline Parreau
An improved lower bound for (1, ≤ 2)-identifying codes in the king grid. Adv. Math. Commun. 8 (1) (2014)
Ville Junnila, Tero Laihonen
Codes for Information Retrieval With Small Uncertainty. IEEE Trans. Inf. Theory 60 (2) (2014)
Sylvain Gravier, Svante Janson, Tero Laihonen, Sanna Maarit Ranto
Graphs where every k-subset of vertices is an identifying set. Discret. Math. Theor. Comput. Sci. 16 (1) (2014)
Ville Junnila, Tero Laihonen
Optimal identification of sets of edges using 2-factors. Discret. Math. 313 (16) (2013)
Ville Junnila, Tero Laihonen, Aline Parreau
Tolerant identification with Euclidean balls. Networks 61 (3) (2013)
Ville Junnila, Tero Laihonen
Optimal Identifying Codes in Cycles and Paths. Graphs Comb. 28 (4) (2012)
Ville Junnila, Tero Laihonen
Optimal lower bound for 2-identifying code in the hexagonal grid CoRR (2012)
Ville Junnila, Tero Laihonen
Optimal Lower Bound for 2-Identifying Codes in the Hexagonal Grid. Electron. J. Comb. 19 (2) (2012)
Ville Junnila, Tero Laihonen
New lower bounds for identifying codes in infinite grids. ISIT (2012)
Ville Junnila, Tero Laihonen, Aline Parreau
Codes for locating objects in sensor networks. ISIT (2012)
Florent Foucaud, Iiro S. Honkala, Tero Laihonen, Aline Parreau, Guillem Perarnau
Locally identifying colourings for graphs with given maximum degree. Discret. Math. 312 (10) (2012)
Florent Foucaud, Iiro S. Honkala, Tero Laihonen, Aline Parreau, Guillem Perarnau
Locally identifying colourings for graphs with given maximum degree CoRR (2011)
Geoffrey Exoo, Ville Junnila, Tero Laihonen
Locating-dominating codes in cycles. Australas. J Comb. 49 (2011)
Ville Junnila, Tero Laihonen
Identification in Z2 using Euclidean balls. Discret. Appl. Math. 159 (5) (2011)
Geoffrey Exoo, Ville Junnila, Tero Laihonen
Locating-dominating codes in paths. Discret. Math. 311 (17) (2011)
Florent Foucaud, Tero Laihonen, Aline Parreau
An improved lower bound for (1,<=2)-identifying codes in the king grid CoRR (2011)
Ville Junnila, Tero Laihonen, Aline Parreau
Tolerant identification with Euclidean balls CoRR (2011)
Iiro S. Honkala, Tero Laihonen
On Vertex-Robust Identifying Codes of Level Three. Ars Comb. 94 (2010)
Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna M. Ranto
Improved bounds on identifying codes in binary Hamming spaces. Eur. J. Comb. 31 (3) (2010)
Svante Janson, Tero Laihonen
An optimal result for codes identifying sets of words. ISIT (2009)
Svante Janson, Tero Laihonen
On the size of identifying codes in binary hypercubes. J. Comb. Theory, Ser. A 116 (5) (2009)
Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna M. Ranto
Upper bounds for binary identifying codes. Adv. Appl. Math. 42 (3) (2009)
Geoffrey Exoo, Tero Laihonen, Sanna M. Ranto
New bounds on binary identifying codes. Discret. Appl. Math. 156 (12) (2008)
Tero Laihonen, Julien Moncel
On graphs admitting t-ID codes. Australas. J Comb. 41 (2008)
Iiro S. Honkala, Tero Laihonen
On Identifying Codes in the King Grid that are Robust Against Edge Deletions. Electron. J. Comb. 15 (1) (2008)
Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna M. Ranto
Improved bounds on binary identifying codes. ISIT (2008)
Tero Laihonen
On cages admitting identifying codes. Eur. J. Comb. 29 (3) (2008)
Iiro S. Honkala, Tero Laihonen
On identifying codes that are robust against edge changes. Inf. Comput. 205 (7) (2007)
Geoffrey Exoo, Tero Laihonen, Sanna M. Ranto
Improved Upper Bounds on Binary Identifying Codes. IEEE Trans. Inf. Theory 53 (11) (2007)
Geoffrey Exoo, Tero Laihonen, Sanna M. Ranto
. ISIT (2007)
Iiro S. Honkala, Tero Laihonen
On a new class of identifying codes in graphs. Inf. Process. Lett. 102 (2-3) (2007)
Iiro S. Honkala, Tero Laihonen
On locating-dominating sets in infinite grids. Eur. J. Comb. 27 (2) (2006)
Tero Laihonen
On robust identification in the square and king grids. Discret. Appl. Math. 154 (17) (2006)
Tero Laihonen
-Identifying Codes in the King Lattice. Graphs Comb. 22 (4) (2006)
Tero Laihonen
)-Identifying Codes. SIAM J. Discret. Math. 18 (4) (2005)
Iiro S. Honkala, Tero Laihonen
On identifying codes in the hexagonal mesh. Inf. Process. Lett. 89 (1) (2004)
Iiro S. Honkala, Tero Laihonen
On identifying codes in the triangular and square grids. SIAM J. Comput. 33 (2) (2004)
Iiro S. Honkala, Tero Laihonen
On identification in the triangular grid. J. Comb. Theory, Ser. B 91 (1) (2004)
Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto
On Locating-Dominating Codes in Binary Hamming Spaces. Discret. Math. Theor. Comput. Sci. 6 (2) (2004)
Iiro S. Honkala, Tero Laihonen
On the Identification of Sets of Points in the Square Lattice. Discret. Comput. Geom. 29 (1) (2003)
Iiro S. Honkala, Tero Laihonen
Codes for Identification in the King Lattice. Graphs Comb. 19 (4) (2003)
Tero Laihonen
Sequences of optimal identifying codes. IEEE Trans. Inf. Theory 48 (3) (2002)
Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto
On strongly identifying codes. Discret. Math. 254 (1-3) (2002)
Sanna M. Ranto, Iiro S. Honkala, Tero Laihonen
Two families of optimal identifying codes in binary Hamming spaces. IEEE Trans. Inf. Theory 48 (5) (2002)
Tero Laihonen
Optimal Codes for Strong Identification. Eur. J. Comb. 23 (3) (2002)
Tero Laihonen, Sanna M. Ranto
Families of optimal codes for strong identification. Discret. Appl. Math. 121 (1-3) (2002)
Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto
On Codes Identifying Sets of Vertices in Hamming Spaces. Des. Codes Cryptogr. 24 (2) (2001)
Tero Laihonen, Sanna M. Ranto
Codes Identifying Sets of Vertices. AAECC (2001)
Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto
Codes for Strong Identification. Electron. Notes Discret. Math. 6 (2001)
Iiro S. Honkala, Tero Laihonen
The probability of undetected error can have several local maxima. IEEE Trans. Inf. Theory 45 (7) (1999)
Alexei E. Ashikhmin, Iiro S. Honkala, Tero Laihonen, Simon Litsyn
On relations between covering radius and dual distance. IEEE Trans. Inf. Theory 45 (6) (1999)
Tero Laihonen, Simon Litsyn
New Bounds On Covering Radius as a Function of Dual Distance. SIAM J. Discret. Math. 12 (2) (1999)
Tero Laihonen
On an algebraic method for bounding the covering radius. Codes and Association Schemes (1999)
Tero Laihonen, Simon Litsyn
On Upper Bounds for Minimum Distances and Covering Radius of Non-binary Codes. Des. Codes Cryptogr. 14 (1) (1998)
Cunsheng Ding, Tero Laihonen, Ari Renvall
Linear Multisecret-Sharing Schemes and Error-Correcting Codes. J. Univers. Comput. Sci. 3 (9) (1997)
Iiro S. Honkala, Tero Laihonen, Simon Litsyn
On Covering Radius and Discrete Chebyshev Polynomials. Appl. Algebra Eng. Commun. Comput. 8 (5) (1997)