Use this resource - and many more! - in your textbook!
AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.
Partial Unit Memory codes based on Gabidulin codes
2011 / IEEE / 978-1-4577-0595-3
This item was taken from the IEEE Conference ' Partial Unit Memory codes based on Gabidulin codes ' (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.
Partial Unit Memory Codes
Modified Rank Metric
Sum Rank Metric
Free Rank Distance
(partial) Unit Memory Codes
Extended Row Rank Distance