In *Proceedings of the IEEE International Symposium on Information Theory (ISIT)*, 2021.

Paper Link doi abstract bibtex

Paper Link doi abstract bibtex

Mean-based reconstruction is a fundamental, natural approach to worst-case trace reconstruction over channels with synchronization errors. It is known that $\exp(O(n^{1/3}))$ traces are necessary and sufficient for mean-based worst-case trace reconstruction over the deletion channel, and this result was also extended to certain channels combining deletions and geometric insertions of uniformly random bits. In this work, we use a simple extension of the original complex-analytic approach to show that these results are examples of a much more general phenomenon: $\exp(O(n^{1/3}))$ traces suffice for mean-based worst-case trace reconstruction over any memoryless channel that maps each input bit to an arbitrarily distributed sequence of replications and insertions of random bits, provided the length of this sequence follows a sub-exponential distribution.

@INPROCEEDINGS{ref:CDRV21, author = {Mahdi Cheraghchi and Joseph Downs and Jo\~{a}o Ribeiro and Alexandra Veliche}, title = {Mean-Based Trace Reconstruction over Practically any Replication-Insertion Channel}, year = 2021, booktitle = {Proceedings of the {IEEE International Symposium on Information Theory (ISIT)}}, url_Paper = {https://arxiv.org/abs/2102.09490}, url_Link = {https://ieeexplore.ieee.org/document/9518161}, doi = {10.1109/ISIT45174.2021.9518161}, abstract = {Mean-based reconstruction is a fundamental, natural approach to worst-case trace reconstruction over channels with synchronization errors. It is known that $\exp(O(n^{1/3}))$ traces are necessary and sufficient for mean-based worst-case trace reconstruction over the deletion channel, and this result was also extended to certain channels combining deletions and geometric insertions of uniformly random bits. In this work, we use a simple extension of the original complex-analytic approach to show that these results are examples of a much more general phenomenon: $\exp(O(n^{1/3}))$ traces suffice for mean-based worst-case trace reconstruction over any memoryless channel that maps each input bit to an arbitrarily distributed sequence of replications and insertions of random bits, provided the length of this sequence follows a sub-exponential distribution.} }

Downloads: 0