activity
20082026
most citedLocally identifying colourings for graphs with given maximum degree

19 citations · 36 across the 21 of their papers we have counts for

collaborators
Showing cs.ITShow all

5 papers · 1 filter

cs.IT2026

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…

cs.IT2025

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…

cs.IT2024

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…

cs.IT2022

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…

cs.IT2011

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,…