activity
20112022
most citedBounds on Codes Correcting Tandem and Palindromic Duplications

10 citations · 19 across the 15 of their papers we have counts for

collaborators

50 papers

cs.IT2022

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…

cs.IT2022

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…

cs.IT2022

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…

cs.IT2022

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…

cs.IT20221 cited

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…

cs.IT2022

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…