10 citations · 11 across the 2 of their papers we have counts for
10 papers
Concatenated Codes for Recovery From Multiple Reads of DNA Sequences
Andreas Lenz, Issam Maarouf, Lorenz Welter +3
Decoding sequences that stem from multiple transmissions of a codeword over an insertion, deletion, and substitution channel is a critical component of efficient deoxyribonucleic a…
Achievable Rates of Concatenated Codes in DNA Storage under Substitution Errors
Andreas Lenz, Lorenz Welter, Sven Puchinger
In this paper, we study achievable rates of concatenated coding schemes over a deoxyribonucleic acid (DNA) storage channel. Our channel model incorporates the main features of DNA-…
Optimal Codes Correcting a Burst of Deletions of Variable Length
Andreas Lenz, Nikita Polyanskii
In this paper, we present an efficiently encodable and decodable code construction that is capable of correction a burst of deletions of length at most . The redundancy of this…
Covering Codes using Insertions or Deletions
Andreas Lenz, Cyrus Rashtchian, Paul H. Siegel +1
A covering code is a set of codewords with the property that the union of balls, suitably defined, around these codewords covers an entire space. Generally, the goal is to find the…
Clustering-Correcting Codes
Tal Shinkar, Eitan Yaakobi, Andreas Lenz +1
A new family of codes, called clustering-correcting codes, is presented in this paper. This family of codes is motivated by the special structure of data that is stored in DNA-base…
Anchor-Based Correction of Substitutions in Indexed Sets
Andreas Lenz, Paul H. Siegel, Antonia Wachter-Zeh +1
Motivated by DNA-based data storage, we investigate a system where digital information is stored in an unordered set of several vectors over a finite alphabet. Each vector begins w…