9 citations · 19 across the 6 of their papers we have counts for
6 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…
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…
Error-Erasure Decoding of Linearized Reed-Solomon Codes in the Sum-Rank Metric
Felicitas Hörmann, Hannes Bartz, Sven Puchinger
Codes in the sum-rank metric have various applications in error control for multishot network coding, distributed storage and code-based cryptography. Linearized Reed-Solomon (LRS)…
Efficient Decoding of Folded Linearized Reed-Solomon Codes in the Sum-Rank Metric
Felicitas Hörmann, Hannes Bartz
Recently, codes in the sum-rank metric attracted attention due to several applications in e.g. multishot network coding, distributed storage and quantum-resistant cryptography. The…