Please use this identifier to cite or link to this item:
Title: A new rank metric for convolutional codes
Author: Almeida, P.
Napp, D.
Keywords: Convolutional codes
Rank metric
Column distance
Network coding
Maximum distance profile
Issue Date: Jan-2021
Publisher: Springer
Abstract: Let F[D] be the polynomial ring with entries in a finite field F. Convolutional codes are submodules of F[D]n that can be described by left prime polynomial matrices. In the last decade there has been a great interest in convolutional codes equipped with a rank metric, called sum rank metric, due to their wide range of applications in reliable linear network coding. However, this metric suits only for delay free networks. In this work we continue this thread of research and introduce a new metric that overcomes this restriction and therefore is suitable to handle more general networks. We study this metric and provide characterizations of the distance properties in terms of the polynomial matrix representations of the convolutional code. Convolutional codes that are optimal with respect to this new metric are investigated and concrete constructions are presented. These codes are the analogs of Maximum Distance Profile convolutional codes in the context of network coding. Moreover, we show that they can be built upon a class of superregular matrices, with entries in an extension field, that preserve their superregularity properties even after multiplication with some matrices with entries in the ground field.
Peer review: yes
DOI: 10.1007/s10623-020-00808-w
ISSN: 0925-1022
Appears in Collections:CIDMA - Artigos
AGG - Artigos
DMat - Artigos

Files in This Item:
File Description SizeFormat 
new_metric_2020_06_20.pdf342.72 kBAdobe PDFView/Open

Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.