Tero Laihonen

According to our database1, Tero Laihonen authored at least 69 papers between 1997 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
The solid-metric dimension.
Theor. Comput. Sci., 2020

Tolerant location detection in sensor networks.
Adv. Appl. Math., 2020

2019
On <i>t</i>-revealing codes in binary Hamming spaces.
Inf. Comput., 2019

Solving Two Conjectures regarding Codes for Location in Circulant Graphs.
Discret. Math. Theor. Comput. Sci., 2019

On Stronger Types of Locating-dominating Codes.
Discret. Math. Theor. Comput. Sci., 2019

On a Conjecture Regarding Identification in Hamming Graphs.
Electron. J. Comb., 2019

Optimal bounds on codes for location in circulant graphs.
Cryptogr. Commun., 2019

The Levenshtein's Channel and the List Size in Information Retrieval.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
On {ℓ}-Metric Dimensions in Graphs.
Fundam. Informaticae, 2018

On regular and new types of codes for location-domination.
Discret. Appl. Math., 2018

2017
Information retrieval and the average number of input clues.
Adv. Math. Commun., 2017

Improved codes for list decoding in the Levenshtein's channel and information retrieval.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Information Retrieval With Varying Number of Input Clues.
IEEE Trans. Inf. Theory, 2016

The metric dimension for resolving several objects.
Inf. Process. Lett., 2016

Minimum Number of Input Clues in Robust Information Retrieval.
Fundam. Informaticae, 2016

2015
Information retrieval with unambiguous output.
Inf. Comput., 2015

2014
Codes for Information Retrieval With Small Uncertainty.
IEEE Trans. Inf. Theory, 2014

Graphs where every k-subset of vertices is an identifying set.
Discret. Math. Theor. Comput. Sci., 2014

An improved lower bound for (1, ≤ 2)-identifying codes in the king grid.
Adv. Math. Commun., 2014

2013
Tolerant identification with Euclidean balls.
Networks, 2013

Optimal identification of sets of edges using 2-factors.
Discret. Math., 2013

2012
Optimal Identifying Codes in Cycles and Paths.
Graphs Comb., 2012

Locally identifying colourings for graphs with given maximum degree.
Discret. Math., 2012

Optimal lower bound for 2-identifying code in the hexagonal grid
CoRR, 2012

Optimal Lower Bound for 2-Identifying Codes in the Hexagonal Grid.
Electron. J. Comb., 2012

Codes for locating objects in sensor networks.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

New lower bounds for identifying codes in infinite grids.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Locating-dominating codes in paths.
Discret. Math., 2011

Identification in Z2 using Euclidean balls.
Discret. Appl. Math., 2011

Locating-dominating codes in cycles.
Australas. J Comb., 2011

2010
Improved bounds on identifying codes in binary Hamming spaces.
Eur. J. Comb., 2010

On Vertex-Robust Identifying Codes of Level Three.
Ars Comb., 2010

2009
On the size of identifying codes in binary hypercubes.
J. Comb. Theory, Ser. A, 2009

Upper bounds for binary identifying codes.
Adv. Appl. Math., 2009

An optimal result for codes identifying sets of words.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
On cages admitting identifying codes.
Eur. J. Comb., 2008

New bounds on binary identifying codes.
Discret. Appl. Math., 2008

On Identifying Codes in the King Grid that are Robust Against Edge Deletions.
Electron. J. Comb., 2008

On graphs admitting t-ID codes.
Australas. J Comb., 2008

Improved bounds on binary identifying codes.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
Improved Upper Bounds on Binary Identifying Codes.
IEEE Trans. Inf. Theory, 2007

On a new class of identifying codes in graphs.
Inf. Process. Lett., 2007

On identifying codes that are robust against edge changes.
Inf. Comput., 2007

Improved Identifying Codes in F2<sup>n</sup>.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
Optimal <i>t</i>-Edge-Robust <i>r</i>-Identifying Codes in the King Lattice.
Graphs Comb., 2006

On locating-dominating sets in infinite grids.
Eur. J. Comb., 2006

On robust identification in the square and king grids.
Discret. Appl. Math., 2006

2005
On Optimal Edge-Robust and Vertex-Robust (1, leq<i>l</i>)-Identifying Codes.
SIAM J. Discret. Math., 2005

2004
On identifying codes in the triangular and square grids.
SIAM J. Comput., 2004

On identification in the triangular grid.
J. Comb. Theory, Ser. B, 2004

On identifying codes in the hexagonal mesh.
Inf. Process. Lett., 2004

On Locating-Dominating Codes in Binary Hamming Spaces.
Discret. Math. Theor. Comput. Sci., 2004

2003
Codes for Identification in the King Lattice.
Graphs Comb., 2003

On the Identification of Sets of Points in the Square Lattice.
Discret. Comput. Geom., 2003

2002
Two families of optimal identifying codes in binary Hamming spaces.
IEEE Trans. Inf. Theory, 2002

Sequences of optimal identifying codes.
IEEE Trans. Inf. Theory, 2002

Optimal Codes for Strong Identification.
Eur. J. Comb., 2002

On strongly identifying codes.
Discret. Math., 2002

Families of optimal codes for strong identification.
Discret. Appl. Math., 2002

2001
Codes for Strong Identification.
Electron. Notes Discret. Math., 2001

On Codes Identifying Sets of Vertices in Hamming Spaces.
Des. Codes Cryptogr., 2001

Codes Identifying Sets of Vertices.
Proceedings of the Applied Algebra, 2001

1999
The probability of undetected error can have several local maxima.
IEEE Trans. Inf. Theory, 1999

On relations between covering radius and dual distance.
IEEE Trans. Inf. Theory, 1999

New Bounds On Covering Radius as a Function of Dual Distance.
SIAM J. Discret. Math., 1999

On an algebraic method for bounding the covering radius.
Proceedings of the Codes and Association Schemes, 1999

1998
On Upper Bounds for Minimum Distances and Covering Radius of Non-binary Codes.
Des. Codes Cryptogr., 1998

1997
Linear Multisecret-Sharing Schemes and Error-Correcting Codes.
J. Univers. Comput. Sci., 1997

On Covering Radius and Discrete Chebyshev Polynomials.
Appl. Algebra Eng. Commun. Comput., 1997


  Loading...