Coding for Sequence Reconstruction for Single Edits

01/06/2020
by   Han Mao Kiah, et al.
0

The sequence reconstruction problem, introduced by Levenshtein in 2001, considers a communication scenario where the sender transmits a codeword from some codebook and the receiver obtains multiple noisy reads of the codeword. The common setup assumes the codebook to be the entire space and the problem is to determine the minimum number of distinct reads that is required to reconstruct the transmitted codeword. Motivated by modern storage devices, we study a variant of the problem where the number of noisy reads N is fixed. Specifically, we design reconstruction codes that reconstruct a codeword from N distinct noisy reads. We focus on channels that introduce single edit error (i.e. a single substitution, insertion, or deletion) and their variants, and design reconstruction codes for all values of N. In particular, for the case of a single edit, we show that as the number of noisy reads increases, the number of redundant bits required can be gracefully reduced from log n+O(1) to loglog n+O(1), and then to O(1), where n denotes the length of a codeword. We also show that the redundancy of certain reconstruction codes is within one bit of optimality.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/13/2020

Optimal Reconstruction Codes for Deletion Channels

The sequence reconstruction problem, introduced by Levenshtein in 2001, ...
research
02/20/2023

Reconstruction of Sequences Distorted by Two Insertions

Reconstruction codes are generalizations of error-correcting codes that ...
research
07/02/2022

Balanced reconstruction codes for single edits

Motivated by the sequence reconstruction problem initiated by Levenshtei...
research
11/08/2021

Sequence Reconstruction Problem for Deletion Channels: A Complete Asymptotic Solution

Transmit a codeword x, that belongs to an (ℓ-1)-deletion-correcting code...
research
03/24/2019

Coded trace reconstruction

Motivated by average-case trace reconstruction and coding for portable D...
research
04/29/2021

Variable-Length Codes Independent or Closed with respect to Edit Relations

We investigate inference of variable-length codes in other domains of co...
research
10/21/2022

The sequence reconstruction problem for permutations with the Hamming distance

V. Levenshtein first proposed the sequence reconstruction problem in 200...

Please sign up or login with your details

Forgot password? Click here to reset