Convolutional Codes in Rank Metric With Application to Random Network Coding

@article{WachterZeh2014ConvolutionalCI,
  title={Convolutional Codes in Rank Metric With Application to Random Network Coding},
  author={Antonia Wachter-Zeh and Markus Stinner and Vladimir R. Sidorenko},
  journal={IEEE Transactions on Information Theory},
  year={2014},
  volume={61},
  pages={3199-3213}
}
Random network coding recently attracts attention as a technique to disseminate information in a network. This paper considers a noncoherent multishot network, where the unknown and time-variant network is used several times. In order to create dependence 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… 
View on IEEE
arxiv.org
33 Citations
Highly Influential Citations
3
Background Citations
16
Methods Citations
11

Figures and Tables from this paper

33 Citations

MRD rank metric convolutional codes

This paper introduces a rank distance, which is suitable for convolutional codes, and derive a new Singleton-like upper bound, and proves that this bound is optimal by showing a concrete construction of a family of MRD convolutionAL codes.

Rank Metric Convolutional Codes with Applications in Network Streaming

This work derive the capacity and prove achievability with a layered construction using the previously introduced codes and demonstrates the column sum rank metric determines the effectiveness of a code and construct a family of codes that achieve the maximumColumn sum rank.

Concatenation of convolutional codes and rank metric codes for multi-shot network coding

This paper makes use of the network several times (multi-shot) and impose correlation in the information symbols over time and shows how this simple concatenation scheme can exploit the potential of both codes to produce a code that can correct a large number of error patterns.

Concatenation of convolutional codes and rank metric codes for multi-shot network coding

This paper makes use of the network several times (multi-shot) and impose correlation in the information symbols over time and shows how this simple concatenation scheme can exploit the potential of both codes to produce a code that can correct a large number of error patterns.

Adaptive Construction and Decoding of Random Convolutional Network Error-correction Coding

  • Mingye LiuWangmei Guo
  • Computer Science
    2019 IEEE/CIC International Conference on Communications in China (ICCC)
  • 2019
An adaptive construction and decoding for random convolutional network error correction coding (RCNECC) based on the minimum network-error weight of combination errors to random coding and field ${\mathbb {F}}_{q}$.

Column Rank Distances of Rank Metric Convolutional Codes

The notion of column rank distance of rank metric convolutional codes for any given rate and finite field is introduced and the framework is slightly more general than the one which can be found in the literature.

Multi-shot Network Coding

This Chapter reviews some of the main results and ideas of multi-shot network coding, proposes new approaches and point out some avenues for future research.

Distributed decoding of convolutional network error correction codes

A Viterbi-like decoding algorithm based on the minimum error weight of combined error vectors, which can be carried out directly at sink nodes and can correct any network errors within the capability of convolutional network error correction codes (CNECC).

Convolutional Codes With Maximum Column Sum Rank for Network Streaming

A metric known as the column sum rank that parallels the column Hamming distance when streaming over a network with link failures is introduced and a new family of convolutional codes that maximize the column Sum rank up to the code memory is introduced.

Systematic Maximum Sum Rank Codes

References

SHOWING 1-10 OF 35 REFERENCES

Rank metric convolutional codes for Random Linear Network Coding

In this contribution, non-coherent multi-shot RLNC is considered and convolutional network codes used, in particular Partial Unit Memory (PUM) codes are constructed and it is shown how they can efficiently be decoded when errors, erasures and deviations occur.

Multishot Codes for Network Coding Using Rank-Metric Codes

  • R. NóbregaB. Filho
  • Computer Science
    2010 Third IEEE International Workshop on Wireless Network Coding
  • 2010
This work proposes a general construction of multishot codes for this channel based on the multilevel coding theory, and applies this construction to the rank-metric space, obtainingMultishot rank- Metric codes which, by lifting, can be converted to codes for the aforementioned channel.

Localized dimension growth in random network coding: A convolutional approach

It is shown through analysis that this method performs no worse than random linear network codes in general networks, and can provide significant gains in terms of average decoding delay in combination networks.

A Rank-Metric Approach to Error Control in Random Network Coding

The problem of error control in random linear network coding is addressed from a matrix perspective that is closely related to the subspace perspective of Rotter and Kschischang and an efficient decoding algorithm is proposed that can properly exploit erasures and deviations.

On (Partial) unit memory codes based on Gabidulin codes

An explicit construction of (P)UM codes based on Gabidulin codes is given, which requires a modified rank metric, the so-called sum rank metric.

Coding for Errors and Erasures in Random Network Coding

A Reed-Solomon-like code construction, related to Gabidulin's construction of maximum rank-distance codes, is described and a Sudan-style ldquolist-1rdquo minimum-distance decoding algorithm is provided.

On network-error correcting convolutional codes under the BSC edge error model

This work investigates the performance of CNECCs under the error model of the network where the edges are assumed to be statistically independent binary symmetric channels, each with the same probability of error pe(0 ≤ pe < 0.5).

Some optimal partial-unit-memory codes

A class of time-invariant binary convolutional codes is defined, called partial-unit-memory codes, which are optimal in the sense of having maximum free distance for given values of R, k, and mu (the number of encoder memory cells).

Maximum slope convolutional codes

The slope is an important distance parameter for a convolutional code. It can be used to obtain a lower bound on the active burst distance and in this respect essentially determines the…

Convolutional network codes

  • E. ErezM. Feder
  • Computer Science
    International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.
  • 2004
Convolutional network codes are considered for cyclic graphs and coefficients of lower polynomial degree are drawn to consideration in order to minimize the memory and overhead.