67 citations · 262 across the 80 of their papers we have counts for
103 papers · 1 filter
On the Average List Size of VT Codes under Two Insertions or Two Deletions
Anisha Banerjee, Roni Con, Antonia Wachter-Zeh +1
Levenshtein's classical theorem shows that any code that can uniquely decode from \(t\) deletions can also uniquely decode from \(t\) insertions. This symmetry, however, does not g…
SynDe: Syndrome-guided Decoding of Raw Nanopore Reads
Anisha Banerjee, Roman Sokolovskii, Thomas Heinis +3
Nanopore sequencing technology remains highly error-prone, making efficient error correction essential in DNA-based data storage. Prior work addressed high error rates using convol…
Sequence Reconstruction over Coloring Channels for Protein Identification
Jessica Bariffi, Antonia Wachter-Zeh, Eitan Yaakobi
This paper studies the sequence reconstruction problem for a channel inspired by protein identification. We introduce a coloring channel, where a sequence is transmitted through a…
Decoding Insertions/Deletions via List Recovery
Anisha Banerjee, Roni Con, Antonia Wachter-Zeh +1
In this work, we consider the problem of efficient decoding of codes from insertions and deletions. Most of the known efficient codes are codes with synchronization strings which a…
Correcting Multiple Substitutions in Nanopore-Sequencing Reads
Anisha Banerjee, Yonatan Yehezkeally, Antonia Wachter-Zeh +1
Despite their significant advantages over competing technologies, nanopore sequencers are plagued by high error rates, due to physical characteristics of the nanopore and inherent…
CAT and DOG: Improved Codes for Private Distributed Matrix Multiplication
Christoph Hofmeister, Rawad Bitar, Antonia Wachter-Zeh
We present novel constructions of polynomial codes for private distributed matrix multiplication (PDMM/SDMM) using outer product partitioning (OPP). We extend the degree table fram…
Sequential Decoding of Multiple Traces Over the Syndrome Trellis for Synchronization Errors
Anisha Banerjee, Lorenz Welter, Alexandre Graell i Amat +2
Standard decoding approaches for convolutional codes, such as the Viterbi and BCJR algorithms, entail significant complexity when correcting synchronization errors. The situation w…
Scalable and Reliable Over-the-Air Federated Edge Learning
Maximilian Egger, Christoph Hofmeister, Cem Kaya +2
Federated edge learning (FEEL) has emerged as a core paradigm for large-scale optimization. However, FEEL still suffers from a communication bottleneck due to the transmission of h…
Capacity-Maximizing Input Symbol Selection for Discrete Memoryless Channels
Maximilian Egger, Rawad Bitar, Antonia Wachter-Zeh +2
Motivated by communication systems with constrained complexity, we consider the problem of input symbol selection for discrete memoryless channels (DMCs). Given a DMC, the goal is…
An End-to-End Coding Scheme for DNA-Based Data Storage With Nanopore-Sequenced Reads
Lorenz Welter, Roman Sokolovskii, Thomas Heinis +3
We consider error-correcting coding for deoxyribonucleic acid (DNA)-based storage using nanopore sequencing. We model the DNA storage channel as a sampling noise channel where the…
Coding for Composite DNA to Correct Substitutions, Strand Losses, and Deletions
Frederik Walter, Omer Sabary, Antonia Wachter-Zeh +1
Composite DNA is a recent method to increase the base alphabet size in DNA-based data storage.This paper models synthesizing and sequencing of composite DNA and introduces coding t…
Maximal-Capacity Discrete Memoryless Channel Identification
Maximilian Egger, Rawad Bitar, Antonia Wachter-Zeh +2
The problem of identifying the channel with the highest capacity among several discrete memoryless channels (DMCs) is considered. The problem is cast as a pure-exploration multi-ar…
Correcting a Single Deletion in Reads from a Nanopore Sequencer
Anisha Banerjee, Yonatan Yehezkeally, Antonia Wachter-Zeh +1
Owing to its several merits over other DNA sequencing technologies, nanopore sequencers hold an immense potential to revolutionize the efficiency of DNA storage systems. However, t…
Sparse and Private Distributed Matrix Multiplication with Straggler Tolerance
Maximilian Egger, Marvin Xhemrishi, Antonia Wachter-Zeh +1
This paper considers the problem of outsourcing the multiplication of two private and sparse matrices to untrusted workers. Secret sharing schemes can be used to tolerate straggler…
Randomized Decoding of Linearized Reed-Solomon Codes Beyond the Unique Decoding Radius
Thomas Jerkovits, Hannes Bartz, Antonia Wachter-Zeh
In this paper we address the problem of decoding linearized Reed-Solomon (LRS) codes beyond their unique decoding radius. We analyze the complexity in order to evaluate if the cons…
Error-Correcting Codes for Nanopore Sequencing
Anisha Banerjee, Yonatan Yehezkeally, Antonia Wachter-Zeh +1
Nanopore sequencing, superior to other sequencing technologies for DNA storage in multiple aspects, has recently attracted considerable attention. Its high error rates, however, de…
Geometrical Properties of Balls in Sum-Rank Metric
Cornelia Ott, Hedongliang Liu, Antonia Wachter-Zeh
The sum-rank metric arises as an algebraic approach for coding in MIMO block-fading channels and multishot network coding. Codes designed in the sum-rank metric have raised interes…
Codes Correcting Burst and Arbitrary Erasures for Reliable and Low-Latency Communication
Serge Kas Hanna, Zhiyuan Tan, Wen Xu +1
Motivated by modern network communication applications which require low latency, we study codes that correct erasures with low decoding delay. We provide a simple explicit constru…
Secure Over-the-Air Computation using Zero-Forced Artificial Noise
Luis Maßny, Antonia Wachter-Zeh
Over-the-air computation has the potential to increase the communication-efficiency of data-dependent distributed wireless systems, but is vulnerable to eavesdropping. We consider…
Bounds on Mixed Codes with Finite Alphabets
Yonatan Yehezkeally, Haider Al Kim, Sven Puchinger +1
Mixed codes, which are error-correcting codes in the Cartesian product of different-sized spaces, model degrading storage systems well. While such codes have previously been studie…
Nested Gradient Codes for Straggler Mitigation in Distributed Machine Learning
Luis Maßny, Christoph Hofmeister, Maximilian Egger +2
We consider distributed learning in the presence of slow and unresponsive worker nodes, referred to as stragglers. In order to mitigate the effect of stragglers, gradient coding re…
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,…
Linearized Reed-Solomon Codes with Support-Constrained Generator Matrix and Applications in Multi-Source Network Coding
Hedongliang Liu, Hengjia Wei, Antonia Wachter-Zeh +1
Linearized Reed-Solomon (LRS) codes are evaluation codes based on skew polynomials. They achieve the Singleton bound in the sum-rank metric and therefore are known as maximum sum-r…
Covering Properties of Sum-Rank Metric Codes
Cornelia Ott, Hedongliang Liu, Antonia Wachter-Zeh
The sum-rank metric can be seen as a generalization of both, the rank and the Hamming metric. It is well known that sum-rank metric codes outperform rank metric codes in terms of t…