|
Problemy Peredachi Informatsii, 2011, Volume 47, Issue 2, Pages 38–51
(Mi ppi2044)
|
|
|
|
This article is cited in 21 scientific papers (total in 21 papers)
Coding Theory
On (partial) unit memory codes based on Gabidulin codes
A. Wachtera, V. R. Sidorenkobc, M. Bosserta, V. V. Zyablovc a Ulm University, Institute of Telecommunications and Applied Information Theory (TAIT), Germany
b Ulm University, Germany
c Kharkevich Institute for Information Transmission Problems,
Russian Academy of Sciences, Moscow
Abstract:
(Partial) unit memory ((P)UM) codes provide a powerful possibility to construct convolutional codes based on block codes in order to achieve a high decoding performance. In this contribution, a construction based on Gabidulin codes is considered. This construction requires a modified rank metric, the so-called sum rank metric. For the sum rank metric, the free rank distance, extended row rank distance, and its slope are defined analogous to the extended row distance in the Hamming metric. Upper bounds for the free rank distance and slope of (P)UM codes in the sum rank metric are derived, and an explicit construction of (P)UM codes based on Gabidulin codes is given.
Received: 26.11.2010 Revised: 21.02.2011
Citation:
A. Wachter, V. R. Sidorenko, M. Bossert, V. V. Zyablov, “On (partial) unit memory codes based on Gabidulin codes”, Probl. Peredachi Inf., 47:2 (2011), 38–51; Problems Inform. Transmission, 47:2 (2011), 117–129
Linking options:
https://www.mathnet.ru/eng/ppi2044 https://www.mathnet.ru/eng/ppi/v47/i2/p38
|
Statistics & downloads: |
Abstract page: | 396 | Full-text PDF : | 99 | References: | 66 | First page: | 4 |
|