Convolutional Codes in Rank Metric With Application to Random Network Coding

DOI10.1109/TIT.2015.2424930MaRDI QIDQ2977422zbMATH OpenFDO

Authors Antonia Wachter-Zeh, Markus Stinner, V. R. Sidorenko

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1404.7251

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Convolutional codes (94B10)

Abstract: Random network coding recently attracts attention as a technique to disseminate information in a network. This paper considers a non-coherent multi-shot network, where the unknown and time-variant network is used several times. In order to create dependencies between the different shots, particular convolutional codes in rank metric are used. These codes are so-called (partial) unit memory ((P)UM) codes, i.e., convolutional codes with memory one. First, distance measures for convolutional codes in rank metric are shown and two constructions of (P)UM codes in rank metric based on the generator matrices of maximum rank distance codes are presented. Second, an efficient error-erasure decoding algorithm for these codes is presented. Its guaranteed decoding radius is derived and its complexity is bounded. Finally, it is shown how to apply these codes for error correction in random linear and affine network coding.

Recommendations

• A new rank metric for convolutional codes
• Concatenation of convolutional codes and rank metric codes for multi-shot network coding
• A Rank-Metric Approach to Error Control in Random Network Coding
• Rank-metric codes and their applications
• Codes in the sum-rank metric: fundamentals and applications
• Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding
• Rank-metric codes and their duality theory
• Rank subcodes in multicomponent network coding
• Column rank distances of rank metric convolutional codes
• On the structure of rate<tex>1/n</tex>convolutional codes

Cited in

(10)

• Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
• Concatenation of convolutional codes and rank metric codes for multi-shot network coding
• Systematic maximum sum rank codes
• A new rank metric for convolutional codes
• Theory of supports for linear codes endowed with the sum-rank metric
• On the Capacity of Constrained Permutation Codes for Rank Modulation
• Rank-metric codes and their applications
• Codes in the sum-rank metric: fundamentals and applications
• On the construction of MRD convolutional codes
• Fast decoding of interleaved linearized Reed-Solomon codes and variants

This page was built for publication: Convolutional Codes in Rank Metric With Application to Random Network Coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977422)