Name
Abstract | ||
|---|---|---|
Horizontal and vertical interleavings of arbitrary matrix or vector rank metric codes are considered. A necessary and sufficient condition for an interleaved code to be maximum rank distance (MRO) code is obtained. In particular, horizontal interleaving of Gabidulin vector codes over the field F
<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">q</sub>
m gives an example of a non-Gabidulin MRD code of length more than m. It is shown that interleaving of Gabidulin codes with different sets of locators can be decoded directly by syndrome decoders. Any other decoder can also be used in the case of different locators after making proposed modification of the received word. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/ACCT51235.2020.9383406 | 2020 Algebraic and Combinatorial Coding Theory (ACCT) |
Keywords | DocType | ISBN |
maximum rank distance code,horizontal interleaving,Gabidulin vector codes,interleaved rank metric codes,vertical interleavings,arbitrary matrix,nonGabidulin MRD code,syndrome decoders | Conference | 978-1-6654-0288-0 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vladimir Sidorenko | 1 | 0 | 1.35 |
| Wenhui Li | 2 | 0 | 1.35 |
| G. Kramer | 3 | 1053 | 77.88 |