10 citations · 33 across the 11 of their papers we have counts for
18 papers
Index-Based Concatenated Codes for the Multi-Draw DNA Storage Channel
Lorenz Welter, Issam Maarouf, Andreas Lenz +3
We consider error-correcting coding for DNA-based storage. We model the DNA storage channel as a multi-draw IDS channel where the input data is chunked into short DNA strands,…
Sequential Decoding of Convolutional Codes for Synchronization Errors
Anisha Banerjee, Andreas Lenz, Antonia Wachter-Zeh
Sequential decoding, commonly applied to substitution channels, is a sub-optimal alternative to Viterbi decoding with significantly reduced memory costs. In this work, a sequential…
Concatenated Codes for Multiple Reads of a DNA Sequence
Issam Maarouf, Andreas Lenz, 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…
Multivariate Analytic Combinatorics for Cost Constrained Channels
Andreas Lenz, Stephen Melczer, Cyrus Rashtchian +1
Analytic combinatorics in several variables is a branch of mathematics that deals with deriving the asymptotic behavior of combinatorial quantities by analyzing multivariate genera…
Function-Correcting Codes
Andreas Lenz, Rawad Bitar, Antonia Wachter-Zeh +1
In this paper we study function-correcting codes, a new class of codes designed to protect the function evaluation of a message against errors. We show that FCCs are equivalent to…
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…
Coding over Sets for DNA Storage
Andreas Lenz, Paul H. Siegel, Antonia Wachter-Zeh +1
In this paper we study error-correcting codes for the storage of data in synthetic deoxyribonucleic acid (DNA). We investigate a storage model where a data set is represented by an…
Bounds and Constructions for Multi-Symbol Duplication Error Correcting Codes
Andreas Lenz, Niklas Jünger, Antonia Wachter-Zeh
In this paper, we study codes correcting duplications of consecutive symbols. These errors are known as tandem duplication errors, where a sequence of symbols is repeate…
Coding over Sets for DNA Storage
Andreas Lenz, Paul H. Siegel, Antonia Wachter-Zeh +1
In this paper, we study error-correcting codes for the storage of data in synthetic deoxyribonucleic acid (DNA). We investigate a storage model where data is represented by an unor…
Duplication-Correcting Codes
Andreas Lenz, Antonia Wachter-Zeh, Eitan Yaakobi
In this work, we propose constructions that correct duplications of multiple consecutive symbols. These errors are known as tandem duplications, where a sequence of symbols is repe…
Bounds on Codes Correcting Tandem and Palindromic Duplications
Andreas Lenz, Antonia Wachter-Zeh, Eitan Yaakobi
In this work, we derive upper bounds on the cardinality of tandem duplication and palindromic deletion correcting codes by deriving the generalized sphere packing bound for these e…
Joint Transmit and Receive Filter Optimization for Sub-Nyquist Delay-Doppler Estimation
Andreas Lenz, Manuel S. Stein, A. Lee Swindlehurst
In this article, a framework is presented for the joint optimization of the analog transmit and receive filter with respect to a parameter estimation problem. At the receiver, conv…
Analog Transmit Signal Optimization for Undersampled Delay-Doppler Estimation
Andreas Lenz, Manuel S. Stein, A. Lee Swindlehurst
In this work, the optimization of the analog transmit waveform for joint delay-Doppler estimation under sub-Nyquist conditions is considered. Based on the Bayesian Cramér-Rao lower…