5 citations · 5 across the 7 of their papers we have counts for
16 papers · 1 filter
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…