when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-128717
URL:

; ; ;

### Analysis of the Period Recovery Error Bound

 pdf-format:

### Abstract

The recovery problem is the problem whose input is a corrupted text T that was originally periodic, and where one wishes to recover its original period. The algorithm’s input is T without any information about either the period’s length or the period itself. An algorithm that solves this problem is called a recovery algorithm. In order to make recovery possible, there must be some assumption that not "too many" errors corrupted the initial periodic string. This is called the error bound. In previous recovery algorithms, it was shown that a given error bound of n/((2+ε)p) can lead to O(log_{1+ε} n) period candidates, that are guaranteed to include the original period, where p is the length of the original period (unknown by the algorithm) and ε > 0 is an arbitrary constant.
This paper provides the first analysis of the relationship between the error bound and the number of candidates, as well as identification of the error parameters that still guarantee recovery. We improve the previously known upper error bound on the number of corruptions, n/((2+ε)p), that outputs O(log_{1+ε} n) period candidates. We show how to (1) remove ε from the bound, (2) relax the error bound to allow more errors while keeping the candidates set of size O(log n). It turns out that this relaxation on the previously known upper bound is quite challenging.
To achieve this result we provide what, to our knowledge, is the first known non-trivial lower bound on the Hamming distance between two periodic strings. This proof leads to an error bound, that produces a family of period candidates of size 2log₃ n. We show that this result is tight and further provide a compact representation of the period candidates. We call this representation the canonic period seed.
In addition to providing less restrictive error bounds that guarantee a smaller candidate set, we also provide a hierarchy of more restrictive upper error bounds that asymptotically reduces the size of the potential period candidate set.

### BibTeX - Entry

```@InProceedings{amir_et_al:LIPIcs:2020:12871,
author =	{Amihood Amir and Itai Boneh and Michael Itzhaki and Eitan Kondratovsky},
title =	{{Analysis of the Period Recovery Error Bound}},
booktitle =	{28th Annual European Symposium on Algorithms (ESA 2020)},
pages =	{5:1--5:21},
series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN =	{978-3-95977-162-7},
ISSN =	{1868-8969},
year =	{2020},
volume =	{173},
editor =	{Fabrizio Grandoni and Grzegorz Herman and Peter Sanders},
publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/12871},
URN =		{urn:nbn:de:0030-drops-128717},
doi =		{10.4230/LIPIcs.ESA.2020.5},
annote =	{Keywords: Period Recovery, Period Recovery Hierarchy, Hamming Distance}
}
```

 Keywords: Period Recovery, Period Recovery Hierarchy, Hamming Distance Seminar: 28th Annual European Symposium on Algorithms (ESA 2020) Issue date: 2020 Date of publication: 26.08.2020

DROPS-Home | Fulltext Search | Imprint | Privacy