Name
Abstract | ||
|---|---|---|
This paper presents an algorithm for decoding homogeneous interleaved codes of high interleaving order in the rank metric. The new decoder is an adaption of the Hamming-metric decoder by Metzner and Kapturowski (1990) and guarantees to correct all rank errors of weight up to $d-2$ whose rank over the large base field of the code equals the number of errors, where $d$ is the minimum rank distance of the underlying code. In contrast to previously-known decoding algorithms, the new decoder works for any rank-metric code, not only Gabidulin codes. It is purely based on linear-algebraic computations, and has an explicit and easy-to-handle success condition. Furthermore, a lower bound on the decoding success probability for random errors of a given weight is derived. The relation of the new algorithm to existing interleaved decoders in the special case of Gabidulin codes is given. |
Year | Venue | DocType |
|---|---|---|
2019 | arXiv: Information Theory | Journal |
Volume | Citations | PageRank |
abs/1904.08774 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sven Puchinger | 1 | 25 | 14.73 |
| Julian Renner | 2 | 1 | 1.70 |
| Antonia Wachter-Zeh | 3 | 129 | 33.65 |