5 citations · 14 across the 17 of their papers we have counts for
21 papers
On the Vertices That Belong to All Minimum Identifying Codes
Ville Junnila, Tero Laihonen, Havu Miikonen
Identifying codes in graphs have been widely studied since their introduction by Karpovsky, Chakrabarty and Levitin in 1998. In this paper, we consider the vertices that are in eve…
On the Maximum Number of Vertices that Belong to Every Metric Basis
Anni Hakanen, Ville Junnila, Tero Laihonen +2
Metric bases of graphs have been widely studied since their introduction in the 1970's by Slater and, independently, by Harary and Melter. In this paper, we concentrate on the exis…
Unique Insertion Error Patterns in Levenshtein's Reconstruction Problem
Ville Junnila, Tero Laihonen, Tuomo Lehtilä +1
Levenshtein's sequence reconstruction model plays an essential role in information retrieval of advanced memory systems, such as the DNA-based storage systems. In the model, a word…
The Size of the Intersection of -ary Hamming Balls
Ville Junnila, Tero Laihonen, Tuomo Lehtilä +1
The interest in studying the size of the intersection of multiple -ary Hamming balls has grown due to the recent advances in DNA-based data storage systems. We present an exact…
New Results on Vertices that Belong to Every Minimum Locating-Dominating Code
Ville Junnila, Tero Laihonen, Havu Miikonen
Locating-dominating codes have been studied widely since their introduction in the 1980s by Slater and Rall. In this paper, we concentrate on vertices that must belong to all minim…
Levenshtein's Sequence Reconstruction Problem and Results for Larger Alphabet Sizes
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
The problem of storing large amounts of information safely for a long period of time has become essential. One of the most promising new data storage mediums are the polymer-based…
On Unique Error Patterns in the Levenshtein's Sequence Reconstruction Model
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
In the Levenshtein's sequence reconstruction problem a codeword is transmitted through channels and in each channel a set of errors is introduced to the transmitted word. In pr…
On Iiro Honkala's contributions to identifying codes
Olivier Hudry, Ville Junnila, Antoine Lobstein
A set of vertices in a graph is an identifying code if it is dominating and any two vertices of are dominated by distinct sets of codewords. This paper presents a…
New Optimal Results on Codes for Location in Graphs
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
In this paper, we broaden the understanding of the recently introduced concepts of solid-locating-dominating and self-locating-dominating codes in various graphs. In particular, we…
The Levenshtein's Sequence Reconstruction Problem and the Length of the List
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
In the paper, the Levenshtein's sequence reconstruction problem is considered in the case where at most substitution errors occur in each of the channels and the decoder ou…
On the unicyclic graphs having vertices that belong to all their (strong) metric bases
Anni Hakanen, Ville Junnila, Tero Laihonen +1
A metric basis in a graph is a smallest possible set of vertices of , with the property that any two vertices of are uniquely recognized by using a vector of distanc…
On Vertices Contained in All or in No Metric Basis
Anni Hakanen, Ville Junnila, Tero Laihonen +1
A set is a resolving set of a graph if for all distinct vertices there exists an element such that . The metric…
Improved Lower Bound for Locating-Dominating Codes in Binary Hamming Spaces
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
In this article, we study locating-dominating codes in binary Hamming spaces . Locating-dominating codes have been widely studied since their introduction in 1980s by…
On the Metric Dimensions for Sets of Vertices
Anni Hakanen, Ville Junnila, Tero Laihonen +1
Resolving sets were originally designed to locate vertices of a graph one at a time. For the purpose of locating multiple vertices of the graph simultaneously, -resolving…
On Stronger Types of Locating-dominating Codes
Ville Junnila, Tero Laihonen, Tuomo Lehtilä +1
Locating-dominating codes in a graph find their application in sensor networks and have been studied extensively over the years. A locating-dominating code can locate one object in…
Solving a Conjecture on Identification in Hamming Graphs
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
Identifying codes in graphs have been widely studied since their introduction by Karpovsky, Chakrabarty and Levitin in 1998. In particular, there are a lot of results regarding the…
Optimal bounds on codes for location in circulant graphs
Ville Junnila, Tero Laihonen, Gabrielle Paris
Identifying and locating-dominating codes have been studied widely in circulant graphs of type over the recent years. In 2013, Ghebleh and Niepel studied loca…
Solving Two Conjectures regarding Codes for Location in Circulant Graphs
Ville Junnila, Tero Laihonen, Gabrielle Paris
Identifying and locating-dominating codes have been widely studied in circulant graphs of type , which can also be viewed as power graphs of cycles. Recently,…
Optimal lower bound for 2-identifying code in the hexagonal grid
Ville Junnila, Tero Laihonen
An -identifying code in a graph is a subset such that for each the intersection of and the ball of radius centered at is non-em…
New lower bound for 2-identifying code in the square grid
Ville Junnila
An -identifying code in a graph is a subset such that for each the intersection of and the ball of radius centered at is nonemp…
Tolerant identification with Euclidean balls
Ville Junnila, Tero Laihonen, Aline Parreau
The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. The identifying codes can be applied, for example, to sensor networks. In this paper,…