Partial Unit Memory codes based on Gabidulin codes

Antonia Wachter, Vladimir Sidorenko, Martin Bossert, Victor Zyablov

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Citations (Scopus)

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.

Original languageEnglish
Title of host publication2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Pages2487-2491
Number of pages5
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 - St. Petersburg, Russian Federation
Duration: 31 Jul 20115 Aug 2011

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8104

Conference

Conference2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Country/TerritoryRussian Federation
CitySt. Petersburg
Period31/07/115/08/11

Keywords

  • (Partial) Unit Memory Codes
  • Convolutional Codes
  • Gabidulin Codes
  • Rank Metric

Fingerprint

Dive into the research topics of 'Partial Unit Memory codes based on Gabidulin codes'. Together they form a unique fingerprint.

Cite this