Rank-metric codes and their applications
The rank metric measures the distance between two matrices by the rank of their difference.
Codes designed for the rank metric have attracted considerable attention in recent years …
Codes designed for the rank metric have attracted considerable attention in recent years …
Fast decoding of codes in the rank, subspace, and sum-rank metric
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 …
interleaved Gabidulin codes in the rank metric, lifted interleaved Gabidulin codes in the …
Fast decoding of interleaved linearized Reed-Solomon codes and variants
H Bartz, S Puchinger - arXiv preprint arXiv:2201.01339, 2022 - arxiv.org
We construct $ s $-interleaved linearized Reed--Solomon (ILRS) codes and variants and
propose efficient decoding schemes that can correct errors beyond the unique decoding …
propose efficient decoding schemes that can correct errors beyond the unique decoding …
Decoding of interleaved linearized Reed-Solomon codes with applications to network coding
H Bartz, S Puchinger - 2021 IEEE International Symposium on …, 2021 - ieeexplore.ieee.org
Recently, Martínez-Peñas and Kschischang (IEEE Trans. Inf. Theory, 2019) showed that
lifted linearized Reed-Solomon codes are suitable codes for error control in multishot …
lifted linearized Reed-Solomon codes are suitable codes for error control in multishot …
Error-erasure decoding of linearized Reed-Solomon codes in the sum-rank metric
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) …
coding, distributed storage and code-based cryptography. Linearized Reed-Solomon (LRS) …
Interpolation-based decoding of folded variants of linearized and skew Reed–Solomon codes
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 …
suitable for error correction in multishot network coding and distributed storage as well as for …
Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases.
H Bartz, A Wachter-Zeh - Advances in Mathematics of …, 2018 - search.ebscohost.com
An interpolation-based decoding scheme for L-interleaved subspace codes is presented.
The scheme can be used as a (not necessarily polynomial-time) list decoder as well as a …
The scheme can be used as a (not necessarily polynomial-time) list decoder as well as a …
A new code-based signature scheme with shorter public key
Y Song, X Huang, Y Mu, W Wu - Cryptology ePrint Archive, 2019 - eprint.iacr.org
Code-based signature has been believed to be a useful authentication tool for post-quantum
cryptography. There have been some attempts to construct efficient code-based signatures; …
cryptography. There have been some attempts to construct efficient code-based signatures; …
Fast decoding of lifted interleaved linearized Reed–Solomon codes for multishot network coding
H Bartz, S Puchinger - Designs, Codes and Cryptography, 2024 - Springer
Martínez-Peñas and Kschischang (IEEE Trans. Inf. Theory 65 (8): 4785–4803, 2019)
proposed lifted linearized Reed–Solomon codes as suitable codes for error control in …
proposed lifted linearized Reed–Solomon codes as suitable codes for error control in …
An improved Durandal signature scheme
Y Song, X Huang, Y Mu, W Wu - Science China Information Sciences, 2020 - Springer
Constructing secure and effective code-based signature schemes has been an open
problem. In this paper, we efficiently reduce the key size of the Durandal signature scheme …
problem. In this paper, we efficiently reduce the key size of the Durandal signature scheme …