activity
20182022
collaborators

9 papers

cs.IT2022

Fast Kötter-Nielsen-Høholdt Interpolation over Skew Polynomial Rings

Hannes Bartz, Thomas Jerkovits

Skew polynomials are a class of non-commutative polynomials that have several applications in computer science, coding theory and cryptography. In particular, skew polynomials can…

cs.IT2021

Decoding of Space-Symmetric Rank Errors

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. Space-symmetric errors are additive error matrices…

cs.IT2020

Fast Decoding of Codes in the Rank, Subspace, and Sum-Rank Metric

Hannes Bartz, Thomas Jerkovits, Sven Puchinger +1

We speed up existing decoding algorithms for three code classes in different metrics: interleaved Gabidulin codes in the rank metric, lifted interleaved Gabidulin codes in the subs…

cs.IT2020

Nested Tailbiting Convolutional Codes for Secrecy, Privacy, and Storage

Thomas Jerkovits, Onur Günlü, Vladimir Sidorenko +1

A key agreement problem is considered that has a biometric or physical identifier, a terminal for key enrollment, and a terminal for reconstruction. A nested convolutional code des…

cs.IT2019

Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius

Julian Renner, Thomas Jerkovits, Hannes Bartz +3

We address the problem of decoding Gabidulin codes beyond their unique error-correction radius. The complexity of this problem is of importance to assess the security of some rank-…

cs.IT2019

Efficient Decoding of Interleaved Low-Rank Parity-Check Codes

Julian Renner, Thomas Jerkovits, Hannes Bartz

An efficient decoding algorithm for horizontally u-interleaved LRPC codes is proposed and analyzed. Upper bounds on the decoding failure rate and the computational complexity of th…