Coded Trace Reconstruction

DOI10.1109/TIT.2020.2996377zbMath1452.94041arXiv1903.09992OpenAlexW3028579427MaRDI QIDQ5138794

Ryan Gabrys, Mahdi Cheraghchi, Olgica Milenković, João L. Ribeiro

Publication date: 4 December 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1903.09992

zbMATH Keywords

designanalysishigh-rate efficiently encodable codesportable DNA-based storage systems

Mathematics Subject Classification ID

Source coding (94A29)

Related Items (7)

Binomial complexities and Parikh-collinear morphisms ⋮ Tree trace reconstruction using subtraces ⋮ Hidden words statistics for large patterns ⋮ New lower bounds for trace reconstruction ⋮ Reconstructing trees from traces ⋮ The trace reconstruction problem for spider graphs ⋮ Information-Theoretic Foundations of DNA Data Storage

This page was built for publication: Coded Trace Reconstruction