On (Partial) unit memory codes based on Gabidulin codes

Authors:
A. Wachter;V. R. Sidorenko;M. Bossert;V. V. Zyablov
Affiliations:
Institute of Telecommunications and Applied Information Theory (TAIT), Ulm University, Ulm, Germany;Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia and Ulm University, Ulm, Germany;Institute of Telecommunications and Applied Information Theory (TAIT), Ulm University, Ulm, Germany;Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
Venue:
Problems of Information Transmission
Year:
2011

Citing 6
Cited 0

Finite fields

Finite fields
Fundamentals of Convolutional Coding

Fundamentals of Convolutional Coding
On Periodic (Partial) Unit Memory Codes with Maximum Free Distance

Selected papers from the Workshop on Information Protection, Error Control, Cryptology, and Speech Compression
Coding for Errors and Erasures in Random Network Coding

IEEE Transactions on Information Theory
A Rank-Metric Approach to Error Control in Random Network Coding

IEEE Transactions on Information Theory
Bounded minimum distance decoding of unit memory codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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.