164 citations · 214 across the 19 of their papers we have counts for
24 papers
Fast Gao-like Decoding of Horizontally Interleaved Linearized Reed-Solomon Codes
Felicitas Hörmann, Hannes Bartz
Both horizontal interleaving as well as the sum-rank metric are currently attractive topics in the field of code-based cryptography, as they could mitigate the problem of large key…
Fast Decoding of Lifted Interleaved Linearized Reed-Solomon Codes for Multishot Network Coding
Hannes Bartz, Sven Puchinger
Mart{\'ı}nez-Pe{ñ}as and Kschischang (IEEE Trans.\ Inf.\ Theory, 2019) proposed lifted linearized Reed--Solomon codes as suitable codes for error control in multishot network codin…
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…
Distinguishing and Recovering Generalized Linearized Reed-Solomon Codes
Felicitas Hörmann, Hannes Bartz, Anna-Lena Horlemann
We study the distinguishability of linearized Reed-Solomon (LRS) codes by defining and analyzing analogs of the square-code and the Overbeck distinguisher for classical Reed-Solomo…
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…
Interpolation-Based Decoding of Folded Variants of Linearized and Skew Reed-Solomon Codes
Felicitas Hörmann, Hannes Bartz
The sum-rank metric is a hybrid between the Hamming metric and the rank metric and suitable for error correction in multishot network coding and distributed storage as well as for…