no code implementations • 18 Jan 2024 • Maximilian Egger, Rawad Bitar, Antonia Wachter-Zeh, Deniz Gündüz, Nir Weinberger
Based on this capacity estimator, a gap-elimination algorithm termed BestChanID is proposed, which is oblivious to the capacity-achieving input distribution and is guaranteed to output the DMC with the largest capacity, with a desired confidence.
no code implementations • 25 Jun 2023 • Maximilian Egger, Christoph Hofmeister, Antonia Wachter-Zeh, Rawad Bitar
Federated learning collaboratively trains a neural network on privately owned data held by several participating clients.
no code implementations • 9 May 2023 • Marvin Xhemrishi, Johan Östman, Antonia Wachter-Zeh, Alexandre Graell i Amat
Inspired by group testing, the framework leverages overlapping groups of clients to identify the presence of malicious clients in the groups via a decoding operation.
no code implementations • 16 Dec 2022 • Luis Maßny, Christoph Hofmeister, Maximilian Egger, Rawad Bitar, Antonia Wachter-Zeh
Since the number of stragglers in practice is random and unknown a priori, tolerating a fixed number of stragglers can yield a sub-optimal computation load and can result in higher latency.
no code implementations • 8 Dec 2022 • 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.
no code implementations • 16 Feb 2022 • Maximilian Egger, Rawad Bitar, Antonia Wachter-Zeh, Deniz Gündüz
We consider the distributed SGD problem, where a main node distributes gradient calculations among $n$ workers.
no code implementations • 4 Feb 2021 • Thomas Jerkovits, Vladimir Sidorenko, Antonia Wachter-Zeh
This paper investigates the decoding of certain Gabidulin codes that were transmitted over a channel with space-symmetric errors.
Information Theory Information Theory
no code implementations • 4 Feb 2021 • Lorenz Welter, Rawad Bitar, Antonia Wachter-Zeh, Eitan Yaakobi
We show an equivalence between correcting $t$-criss-cross deletions and $t$-criss-cross insertions and show that a code correcting $t$-criss-cross insertions/deletions has redundancy at least $tn + t \log n - \log(t!)$.
Information Theory Information Theory
no code implementations • 3 Feb 2021 • Sven Puchinger, Julian Renner, Antonia Wachter-Zeh, Jens Zumbrägel
The new method consists of two steps: (1) solving a syndrome-based key equation to obtain the annihilator polynomial of the error and therefore the column space of the error, (2) solving a key equation based on the received word in order to reconstruct the error vector.
Information Theory Information Theory
no code implementations • 14 Jan 2021 • Rawad Bitar, Marvin Xhemrishi, Antonia Wachter-Zeh
A master server owns two private matrices $\mathbf{A}$ and $\mathbf{B}$ and hires worker nodes to help computing their multiplication.
Information Theory Information Theory
no code implementations • 8 Jun 2020 • Hedongliang Liu, Hengjia Wei, Sven Puchinger, Antonia Wachter-Zeh, Moshe Schwartz
We derive new upper and lower bounds on the maximum number of nodes in the middle layer, depending on the network parameters and the alphabet size.
Information Theory Networking and Internet Architecture Social and Information Networks Combinatorics Information Theory
2 code implementations • 11 Mar 2019 • Tal Shinkar, Eitan Yaakobi, Andreas Lenz, Antonia Wachter-Zeh
This family of codes is motivated by the special structure of data that is stored in DNA-based storage systems.
Information Theory Information Theory
1 code implementation • 22 Feb 2016 • Clayton Schoeny, Antonia Wachter-Zeh, Ryan Gabrys, Eitan Yaakobi
In this paper we close on this gap and provide codes with redundancy at most $\log(n) + (b-1)\log(\log(n)) +b -\log(b)$.
Information Theory Information Theory