DeepAI AI Chat
Log In Sign Up

Coded trace reconstruction in a constant number of traces

by   Joshua Brakensiek, et al.

The coded trace reconstruction problem asks to construct a code C⊂{0,1}^n such that any x∈ C is recoverable from independent outputs ("traces") of x from a binary deletion channel (BDC). We present binary codes of rate 1-ε that are efficiently recoverable from (O_q(log^1/3(1/ε))) (a constant independent of n) traces of a BDC_q for any constant deletion probability q∈(0,1). We also show that, for rate 1-ε binary codes, Ω̃(log^5/2(1/ε)) traces are required. The results follow from a pair of black-box reductions that show that average-case trace reconstruction is essentially equivalent to coded trace reconstruction. We also show that there exist codes of rate 1-ε over an O_ε(1)-sized alphabet that are recoverable from O(log(1/ε)) traces, and that this is tight.


page 1

page 2

page 3

page 4


Coding for Trace Reconstruction over Multiple Channels with Vanishing Deletion Probabilities

Motivated by DNA-based storage applications, we study the problem of rec...

Coded trace reconstruction

Motivated by average-case trace reconstruction and coding for portable D...

Optimal Codes Detecting Deletions in Concatenated Binary Strings Applied to Trace Reconstruction

Consider two or more strings 𝐱^1,𝐱^2,…, that are concatenated to form 𝐱=...

Coding for Deletion Channels with Multiple Traces

Motivated by the sequence reconstruction problem from traces in DNA-base...

The trace reconstruction problem for spider graphs

We study the trace reconstruction problem for spider graphs. Let n be th...

Trellis BMA: Coded Trace Reconstruction on IDS Channels for DNA Storage

Sequencing a DNA strand, as part of the read process in DNA storage, pro...

Tree trace reconstruction using subtraces

Tree trace reconstruction aims to learn the binary node labels of a tree...