67 citations · 262 across the 80 of their papers we have counts for
17 papers · 1 filter
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…
Equivalence of Insertion/Deletion Correcting Codes for -dimensional Arrays
Evagoras Stylianou, Lorenz Welter, Rawad Bitar +2
We consider the problem of correcting insertion and deletion errors in the -dimensional space. This problem is well understood for vectors (one-dimensional space) and was recent…
Interleaved Prange: A New Generic Decoder for Interleaved Codes
Anmoal Porwal, Lukas Holzbaur, Hedongliang Liu +3
Due to the recent challenges in post-quantum cryptography, several new approaches for code-based cryptography have been proposed. For example, a variant of the McEliece cryptosyste…
Generic Decoding in the Cover Metric
Sebastian Bitzer, Julian Renner, Antonia Wachter-Zeh +1
In this paper, we study the hardness of decoding a random code endowed with the cover metric. As the cover metric lies in between the Hamming and rank metric, it presents itself as…
Rank-Metric Codes and Their Applications
Hannes Bartz, Lukas Holzbaur, Hedongliang Liu +3
The rank metric measures the distance between two matrices by the rank of their difference. Codes designed for the rank metric have attracted considerable attention in recent years…
Distributed Matrix-Vector Multiplication with Sparsity and Privacy Guarantees
Marvin Xhemrishi, Rawad Bitar, Antonia Wachter-Zeh
We consider the problem of designing a coding scheme that allows both sparsity and privacy for distributed matrix-vector multiplication. Perfect information-theoretic privacy requi…
Computational Code-Based Privacy in Coded Federated Learning
Marvin Xhemrishi, Alexandre Graell i Amat, Eirik Rosnes +1
We propose a privacy-preserving federated learning (FL) scheme that is resilient against straggling devices. An adaptive scenario is suggested where the slower devices share their…
Coding and Bounds for Partially Defective Memory Cells
Haider Al Kim, Sven Puchinger, Ludo Tolhuizen +1
This paper considers coding for so-called partially stuck (defect) memory cells. Such memory cells can only store partial information as some of their levels cannot be used fully d…
List Decoding of 2-Interleaved Binary Alternant Codes
Chih-Chiang Huang, Hedongliang Liu, Lukas Holzbaur +2
This paper is concerned with list decoding of -interleaved binary alternant codes. The principle of the proposed algorithm is based on a combination of a list decoding algorithm…
Cost-Efficient Distributed Learning via Combinatorial Multi-Armed Bandits
Maximilian Egger, Rawad Bitar, Antonia Wachter-Zeh +1
We consider the distributed SGD problem, where a main node distributes gradient calculations among workers. By assigning tasks to all the workers and waiting only for the f…
Insertion and Deletion Correction in Polymer-based Data Storage
Anisha Banerjee, Antonia Wachter-Zeh, Eitan Yaakobi
Synthetic polymer-based storage seems to be a particularly promising candidate that could help to cope with the ever-increasing demand for archival storage requirements. It involve…
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…