The increasing demand for data storage has prompted the exploration of new techniques, with molecular data storage being a promising alternative. In this work, we develop coding schemes for a new storage paradigm that can be represented as a collection of two-dimensional arrays. Motivated by error patterns observed in recent prototype architectures, our study focuses on correcting erasures in the last few symbols of each row, and also correcting arbitrary deletions across rows. We present code constructions and explicit encoders and decoders that are shown to be nearly optimal in many scenarios. We show that the new coding schemes are capable of effectively mitigating these errors, making these emerging storage platforms potentially promising solutions.
@article{arxiv.2402.03987,
title = {Tail-Erasure-Correcting Codes},
author = {Boaz Moav and Ryan Gabrys and Eitan Yaakobi},
journal= {arXiv preprint arXiv:2402.03987},
year = {2025}
}