Partial Unit Memory codes based on Gabidulin codes

Author

Wachter, Antonia ; Sidorenko, Vladimir ; Bossert, Martin ; Zyablov, Victor

Author_Institution

Inst. of Telecommun. & Appl. Inf. Theor., Ulm Univ., Ulm, Germany

fYear

2011

fDate

July 31 2011-Aug. 5 2011

Firstpage

2487

Lastpage

2491

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, the extended row rank distance and its slope are defined. Upper bounds for the free rank distance and the slope of (P)UM codes in the sum rank metric are derived. The construction of PUM codes based on Gabidulin codes achieves the upper bound for the free rank distance.

Keywords

block codes; convolutional codes; decoding; Gabidulin codes; block codes; convolutional codes; decoding performance; extended row rank distance; free rank distance; modified rank metric; partial unit memory codes; sum rank metric; Block codes; Convolutional codes; Generators; Measurement; Network coding; Upper bound; (Partial) Unit Memory Codes; Convolutional Codes; Gabidulin Codes; Rank Metric;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on

Conference_Location

St. Petersburg

ISSN

2157-8095

Print_ISBN

978-1-4577-0596-0

Electronic_ISBN

2157-8095

Type

conf

DOI

10.1109/ISIT.2011.6034013

Filename

6034013