Multishot Codes for Network Coding Using Rank-Metric Codes

@article{Nbrega2010MultishotCF,
  title={Multishot Codes for Network Coding Using Rank-Metric Codes},
  author={Roberto Wanderley da N{\'o}brega and Bartolomeu F. Uch{\^o}a Filho},
  journal={2010 Third IEEE International Workshop on Wireless Network Coding},
  year={2010},
  pages={1-6}
}
  • R. NóbregaB. Filho
  • Published 13 January 2010
  • Computer Science
  • 2010 Third IEEE International Workshop on Wireless Network Coding
The multiplicative-additive finite-field matrix channel arises as an adequate model for linear network coding systems when links are subject to errors and erasures, and both the network topology and the network code are unknown. In a previous work we proposed a general construction of multishot codes for this channel based on the multilevel coding theory. Herein we apply this construction to the rank-metric space, obtaining multishot rank-metric codes which, by lifting, can be converted to… 
View on IEEE
arxiv.org
79 Citations
Highly Influential Citations
12
Background Citations
43
Methods Citations
26
Results Citations
1

Figures from this paper

79 Citations

Convolutional Codes in Rank Metric With Application to Random Network Coding

This paper considers a noncoherent multishot network, where the unknown and time-variant network is used several times and particular convolutional codes in rank metric are used in order to create dependence between the different shots.

Coding for linear operator channels over finite fields

This work proposes two coding schemes for LOCs that make use of rank-metric codes and generalizes the rank- Metric approach of subspace coding proposed by Silva et al.

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.

The Capacity of Random Linear Coding Networks as Subspace Channels

A random vector basis selection procedure is introduced which renders the DMC symmetric, and can be seen as a lower bound on the capacity of noncoherent RLCNs, where subspace coding suffices to achieve this bound.

Rate-Diversity Optimal Multiblock Space-Time Codes via Sum-Rank Codes

This work provides the first explicit construction of minimal-delay rate-diversity optimal multiblock space-time codes as an application of linearized Reed-Solomon codes.

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.

Streaming Codes for Multiplicative-Matrix Channels With Burst Rank Loss

This work studies streaming communication over the burst rank loss channel, proposes a new class of codes, ROBIN codes, and establishes their optimality, using the maximum rank distance and maximum sum rank codes from previous works as constituent codes and combines them in a layered fashion.

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.

New Explicit Good Linear Sum-Rank-Metric Codes

Three simple constructions of explicit linear sum-rank-metric codes with good parameters are proposed for space-time coding, which have wide applications in universal error correction and security in multishot network, space- time coding and construction of partial-MDS codes for repair in distributed storage.
...

References

SHOWING 1-10 OF 13 REFERENCES

Multishot codes for network coding: Bounds and a multilevel construction

  • R. NóbregaB. Filho
  • Computer Science
    2009 IEEE International Symposium on Information Theory
  • 2009
This paper explores the idea of using the subspace channel more than once and investigates the so called multishot subspace codes, and presents definitions for the problem, a motivating example, lower and upper bounds for the size of Codes, and a multilevel construction of codes based on block-coded modulation.

On Metrics for Error Correction in Network Coding

It is shown that universal network error correcting codes achieving the Singleton bound can be easily constructed and efficiently decoded and the decoder associated with the injection metric is shown to correct more errors then a minimum-subspace-distance decoder.

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.

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.

Multilevel codes and multistage decoding

The author extends the coding method to coset codes and shows how to calculate minimum squared distance and path multiplicity in terms of the norms and multiplicities of the different cosets.

Author's Reply to Comments on 'Maximum-rank array codes and their application to crisscross error correction'

  • R. Roth
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1992
It is shown that the dimension of such array codes must satisfy the Singleton-like bound k, which is a k-dimensional linear space of n*n matrices over F such that every nonzero matrix in C has rank mu.

A new multilevel coding method using error-correcting codes

A new multilevel coding method that uses several error-correcting codes that makes effective use of soft-decisions to improve the performance of decoding and is superior to other multileVEL coding systems.

Error control coding

The basic goal in digital communications is to transport bits of information without losing too much information along the way. The level of information loss that is tolerable/acceptable varies for…

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

The problem of error control in random network coding is considered, and a formulation of the problem is given in terms of rank-metric codes. This formulation allows many of the tools developed for…

Theory of codes with maximum rank dista nce

  • Problemy Peredachi Informatsii , vol. 21, no. 1, pp. 3–16, 1985.
  • 1985