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 …
Efficient decoding of folded linearized reed-solomon codes in the sum-rank metric
Recently, codes in the sum-rank metric attracted attention due to several applications in eg
multishot network coding, distributed storage and quantum-resistant cryptography. The sum …
multishot network coding, distributed storage and quantum-resistant cryptography. The sum …
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 …
Algebraic decoding of folded Gabidulin codes
H Bartz, V Sidorenko - Designs, Codes and Cryptography, 2017 - Springer
An efficient interpolation-based decoding algorithm for h h-folded Gabidulin codes is
presented that can correct rank errors beyond half the minimum rank distance for any code …
presented that can correct rank errors beyond half the minimum rank distance for any code …
Algebraic list-decoding in projective space: Decoding with multiplicities and rank-metric codes
H Mahdavifar, A Vardy - IEEE Transactions on Information …, 2018 - ieeexplore.ieee.org
The problem of list decoding algebraic subspace codes and rank-metric codes is
considered. We develop two separate methods, via two different approaches, for list …
considered. We develop two separate methods, via two different approaches, for list …
List and probabilistic unique decoding of folded subspace codes
H Bartz, V Sidorenko - 2015 IEEE International Symposium on …, 2015 - ieeexplore.ieee.org
A new class of folded subspace codes for noncoherent network coding is presented. The
codes can correct insertions and deletions beyond the unique decoding radius for any code …
codes can correct insertions and deletions beyond the unique decoding radius for any code …
Improved syndrome decoding of interleaved subspace codes
H Bartz, M Meier, V Sidorenko - SCC 2017; 11th International …, 2017 - ieeexplore.ieee.org
A syndrome decoding algorithm for interleaved subspace codes of order L is proposed. It
corrects L times more packet insertions than known syndrome decoding methods and has …
corrects L times more packet insertions than known syndrome decoding methods and has …
Interleaved subspace codes in fountain mode
V Sidorenko, H Bartz… - 2017 IEEE International …, 2017 - ieeexplore.ieee.org
We consider subspace codes obtained by lifting L-interleaved [n, k] Gabidulin codes. When
used in networks with random linear coding, these codes are able to correct with high …
used in networks with random linear coding, these codes are able to correct with high …
List and probabilistic unique decoding of high-rate folded Gabidulin codes
H Bartz - WCC2015-9th International Workshop on Coding and …, 2015 - inria.hal.science
An efficient interpolation-based decoding algorithm for folded Gabidulin codes is presented
that can correct rank errors beyond half the minimum rank distance for any code rate R∈[0 …
that can correct rank errors beyond half the minimum rank distance for any code rate R∈[0 …