101 citations · 126 across the 11 of their papers we have counts for
17 papers
Support-Guessing Decoding Algorithms in the Sum-Rank Metric
Thomas Jerkovits, Hannes Bartz, Antonia Wachter-Zeh
The sum-rank metric generalizes the Hamming and rank metric by partitioning vectors into blocks and defining the total weight as the sum of the rank weights of these blocks, based…
An Error-Code Perspective on Metzner--Kapturowski-like Decoders
Thomas Jerkovits, Felicitas Hörmann, Hannes Bartz
In this paper we consider a Metzner-Kapturowski-like decoding algorithm for high-order interleaved sum-rank-metric codes, offering a novel perspective on the decoding process throu…
Bounds on Sphere Sizes in the Sum-Rank Metric and Coordinate-Additive Metrics
Hugo Beeloo-Sauerbier Couvée, Thomas Jerkovits, Jessica Bariffi
This paper provides new bounds on the size of spheres in any coordinate-additive metric with a particular focus on improving existing bounds in the sum-rank metric. We derive impro…
Randomized Decoding of Linearized Reed-Solomon Codes Beyond the Unique Decoding Radius
Thomas Jerkovits, Hannes Bartz, Antonia Wachter-Zeh
In this paper we address the problem of decoding linearized Reed-Solomon (LRS) codes beyond their unique decoding radius. We analyze the complexity in order to evaluate if the cons…
On Decoding High-Order Interleaved Sum-Rank-Metric Codes
Thomas Jerkovits, Felicitas Hörmann, Hannes Bartz
We consider decoding of vertically homogeneous interleaved sum-rank-metric codes with high interleaving order , that are constructed by stacking codewords of a single consti…
Fast Kötter-Nielsen-Høholdt Interpolation over Skew Polynomial Rings and its Application in Coding Theory
Hannes Bartz, Thomas Jerkovits, Johan Rosenkilde
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…
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…
Analysis of Communication Channels Related to Physical Unclonable Functions
Georg Maringer, Marvin Xhemrishi, Sven Puchinger +6
Cryptographic algorithms rely on the secrecy of their corresponding keys. On embedded systems with standard CMOS chips, where secure permanent memory such as flash is not available…
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…
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…
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…
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-…
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…
Successive Cancellation List Decoding of Product Codes with Reed-Muller Component Codes
Mustafa Cemil Coşkun, Thomas Jerkovits, Gianluigi Liva
This letter proposes successive cancellation list (SCL) decoding of product codes with Reed--Muller (RM) component codes. SCL decoding relies on a product code description based on…
Efficient Error-Correcting Codes in the Short Blocklength Regime
Mustafa Cemil Coşkun, Giuseppe Durisi, Thomas Jerkovits +4
The design of block codes for short information blocks (e.g., a thousand or less information bits) is an open research problem that is gaining relevance thanks to emerging applicat…
Improving the Decoding Threshold of Tailbiting Spatially Coupled LDPC Codes by Energy Shaping
Thomas Jerkovits, Gianluigi Liva, Alexandre Graell i Amat
We show how the iterative decoding threshold of tailbiting spatially coupled (SC) low-density parity-check (LDPC) code ensembles can be improved over the binary input additive whit…
Code Design for Short Blocks: A Survey
Gianluigi Liva, Lorenzo Gaudio, Tudor Ninacs +1
The design of block codes for short information blocks (e.g., a thousand or less information bits) is an open research problem which is gaining relevance thanks to emerging applica…