activity
20172022
most citedDecoding High-Order Interleaved Rank-Metric Codes

1 citations · 1 across the 4 of their papers we have counts for

collaborators

15 papers

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.IT2021

Efficient Decoding of Gabidulin Codes over Galois Rings

Sven Puchinger, Julian Renner, Antonia Wachter-Zeh +1

This paper presents the first decoding algorithm for Gabidulin codes over Galois rings with provable quadratic complexity. The new method consists of two steps: (1) solving a syndr…

cs.IT2020

On Software Implementation of Gabidulin Decoders

Johannes Kunz, Julian Renner, Georg Maringer +2

This work compares the performance of software implementations of different Gabidulin decoders. The parameter sets used within the comparison stem from their applications in recent…

cs.IT2020

Low-Rank Parity-Check Codes over Galois Rings

Julian Renner, Alessandro Neri, Sven Puchinger

Low-rank parity-check (LRPC) are rank-metric codes over finite fields, which have been proposed by Gaborit et al. (2013) for cryptographic applications. Inspired by a recent adapti…