New upper bounds for trace reconstruction

MaRDI QIDQ6348604zbMATH OpenFDO

Authors Zachary Chase

Publication date 7 September 2020

Abstract: We show that any $n$-bit string can be recovered with high probability from $exp(widetildeO(n^{1/5}))$ independent random subsequences.

This page was built for publication: New upper bounds for trace reconstruction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6348604)