Tero Laihonen

Havu Miikonen

CoRR, September, 2025

On Unique Error Patterns in the Levenshtein's Sequence Reconstruction Model.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, July, 2025

Levenshtein's sequence reconstruction problem and results for larger alphabet sizes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2025

On the Intersections of q-ary Hamming Balls.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2025

On Levenshtein's Reconstruction Problem for Channels with Unique Insertion Error Patterns.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2025

On a Tight Bound for the Maximum Number of Vertices that Belong to Every Metric Basis.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2025

2024

The Levenshtein's Sequence Reconstruction Problem and the Length of the List.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, February, 2024

Optimal Local Identifying and Local Locating-dominating Codes.

[BibT_eX]

[DOI]

Pyry Herva

Fundam. Informaticae, 2024

Preface.

[BibT_eX]

[DOI]

Vesa Halava

Jarkko Kari

Fundam. Informaticae, 2024

On the unicyclic graphs having vertices that belong to all their (strong) metric bases.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

2023

On the metric dimensions for sets of vertices.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2023

New Optimal Results on Codes for Location in Graphs.

[BibT_eX]

[DOI]

CoRR, 2023

Levenshtein's Reconstruction Problem with Different Error Patterns.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

Improved lower bound for locating-dominating codes in binary Hamming spaces.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2022

On vertices contained in all or in no metric basis.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

On the List Size in the Levenshtein's Sequence Reconstruction Problem.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

2020

The solid-metric dimension.

[BibT_eX]

[DOI]

Anni Hakanen

Theor. Comput. Sci., 2020

Tolerant location detection in sensor networks.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2020

2019

On t-revealing codes in binary Hamming spaces.

[BibT_eX]

[DOI]

Inf. Comput., 2019

Solving Two Conjectures regarding Codes for Location in Circulant Graphs.

[BibT_eX]

[DOI]

Gabrielle Paris

Discret. Math. Theor. Comput. Sci., 2019

On Stronger Types of Locating-dominating Codes.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2019

On a Conjecture Regarding Identification in Hamming Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2019

Optimal bounds on codes for location in circulant graphs.

[BibT_eX]

[DOI]

Gabrielle Paris

Cryptogr. Commun., 2019

The Levenshtein's Channel and the List Size in Information Retrieval.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

On {ℓ}-Metric Dimensions in Graphs.

[BibT_eX]

[DOI]

Anni Hakanen

Fundam. Informaticae, 2018

On regular and new types of codes for location-domination.

[BibT_eX]

[DOI]

Tuomo Lehtila

Discret. Appl. Math., 2018

2017

Information retrieval and the average number of input clues.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2017

Improved codes for list decoding in the Levenshtein's channel and information retrieval.

[BibT_eX]

[DOI]

Tuomo Lehtila

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

Information Retrieval With Varying Number of Input Clues.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

The metric dimension for resolving several objects.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

Minimum Number of Input Clues in Robust Information Retrieval.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2016

2015

Information retrieval with unambiguous output.

[BibT_eX]

[DOI]

Inf. Comput., 2015

2014

Codes for Information Retrieval With Small Uncertainty.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Graphs where every k-subset of vertices is an identifying set.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2014

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

[BibT_eX]

[DOI]

Florent Foucaud

Aline Parreau

Adv. Math. Commun., 2014

2013

Tolerant identification with Euclidean balls.

[BibT_eX]

[DOI]

Aline Parreau

Networks, 2013

Optimal identification of sets of edges using 2-factors.

[BibT_eX]

[DOI]

Discret. Math., 2013

2012

Optimal Identifying Codes in Cycles and Paths.

[BibT_eX]

[DOI]

Graphs Comb., 2012

Locally identifying colourings for graphs with given maximum degree.

[BibT_eX]

[DOI]

Discret. Math., 2012

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

[BibT_eX]

[DOI]

CoRR, 2012

Optimal Lower Bound for 2-Identifying Codes in the Hexagonal Grid.

[BibT_eX]

[DOI]

Electron. J. Comb., 2012

Codes for locating objects in sensor networks.

[BibT_eX]

[DOI]

Aline Parreau

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

New lower bounds for identifying codes in infinite grids.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

Locating-dominating codes in paths.

[BibT_eX]

[DOI]

Discret. Math., 2011

Identification in Z2 using Euclidean balls.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Locating-dominating codes in cycles.

[BibT_eX]

[DOI]

Australas. J Comb., 2011

2010

Improved bounds on identifying codes in binary Hamming spaces.

[BibT_eX]

[DOI]

Eur. J. Comb., 2010

On Vertex-Robust Identifying Codes of Level Three.

[BibT_eX]

Ars Comb., 2010

2009

On the size of identifying codes in binary hypercubes.

[BibT_eX]

[DOI]

Svante Janson

J. Comb. Theory A, 2009

Upper bounds for binary identifying codes.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2009

An optimal result for codes identifying sets of words.

[BibT_eX]

[DOI]

Svante Janson

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

On cages admitting identifying codes.

[BibT_eX]

[DOI]

Eur. J. Comb., 2008

New bounds on binary identifying codes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

On Identifying Codes in the King Grid that are Robust Against Edge Deletions.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

On graphs admitting t-ID codes.

[BibT_eX]

[DOI]

Julien Moncel

Australas. J Comb., 2008

Improved bounds on binary identifying codes.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007

Improved Upper Bounds on Binary Identifying Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

On a new class of identifying codes in graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

On identifying codes that are robust against edge changes.

[BibT_eX]

[DOI]

Inf. Comput., 2007

Improved Identifying Codes in F2n.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

Optimal t-Edge-Robust r-Identifying Codes in the King Lattice.

[BibT_eX]

[DOI]

Graphs Comb., 2006

On locating-dominating sets in infinite grids.

[BibT_eX]

[DOI]

Eur. J. Comb., 2006

On robust identification in the square and king grids.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

2005

On Optimal Edge-Robust and Vertex-Robust (1, leql)-Identifying Codes.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2005

2004

On identifying codes in the triangular and square grids.

[BibT_eX]

[DOI]

SIAM J. Comput., 2004

On identification in the triangular grid.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2004

On identifying codes in the hexagonal mesh.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2004

On Locating-Dominating Codes in Binary Hamming Spaces.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2004

2003

Codes for Identification in the King Lattice.

[BibT_eX]

[DOI]

Graphs Comb., 2003

On the Identification of Sets of Points in the Square Lattice.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2003

2002

Two families of optimal identifying codes in binary Hamming spaces.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

Sequences of optimal identifying codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

Optimal Codes for Strong Identification.

[BibT_eX]

[DOI]

Eur. J. Comb., 2002

On strongly identifying codes.

[BibT_eX]

[DOI]

Discret. Math., 2002

Families of optimal codes for strong identification.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

2001

Codes for Strong Identification.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

On Codes Identifying Sets of Vertices in Hamming Spaces.

[BibT_eX]

Des. Codes Cryptogr., 2001

Codes Identifying Sets of Vertices.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 2001

1999

The probability of undetected error can have several local maxima.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

On relations between covering radius and dual distance.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

New Bounds On Covering Radius as a Function of Dual Distance.

[BibT_eX]

[DOI]

Simon Litsyn

SIAM J. Discret. Math., 1999

On an algebraic method for bounding the covering radius.

[BibT_eX]

[DOI]

Proceedings of the Codes and Association Schemes, 1999

1998

On Upper Bounds for Minimum Distances and Covering Radius of Non-binary Codes.

[BibT_eX]

[DOI]

Simon Litsyn

Des. Codes Cryptogr., 1998

1997

Linear Multisecret-Sharing Schemes and Error-Correcting Codes.

[BibT_eX]

[DOI]

Cunsheng Ding

Ari Renvall

J. Univers. Comput. Sci., 1997

On Covering Radius and Discrete Chebyshev Polynomials.

[BibT_eX]

[DOI]