Enhanced algebraic error control for random linear network coding

@article{Yan2012EnhancedAE,
  title={Enhanced algebraic error control for random linear network coding},
  author={Zhiyuan Yan and Hongmei Xie},
  journal={MILCOM 2012 - 2012 IEEE Military Communications Conference},
  year={2012},
  pages={1-6}
}
  • Zhiyuan YanHongmei Xie
  • Published 3 May 2012
  • Computer Science
  • MILCOM 2012 - 2012 IEEE Military Communications Conference
Error control is significant to network coding, since when unchecked, errors greatly deteriorate the throughput gains of network coding and seriously undermine both reliability and security of data. Two families of codes, subspace and rank metric codes, have been used to provide error control for random linear network coding. In this paper, we enhance the error correction capability of these two families of codes by using a novel two-tier decoding scheme. While the decoding of subspace and rank… 
2 Citations

References

SHOWING 1-10 OF 13 REFERENCES

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 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.

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.

Algebraic list-decoding on the operator channel

For any integer L, the list-L decoder guarantess successful recovery of the message subspace provided the normalized dimension of the error is at most L − L2(L + 1) over 2 R where R is the normalized rate of the code.

A Random Linear Network Coding Approach to Multicast

This work presents a distributed random linear network coding approach for transmission and compression of information in general multisource multicast networks, and shows that this approach can take advantage of redundant network capacity for improved success probability and robustness.

Analysis of network error correction based on network coding

For network error-correcting codes based on network coding an explicit lower bound on the size of source alphabet is presented. This bound is deduced by a Gilbert-Varshamov greedy algorithm. The

Network coding and error correction

  • N. CaiR. Yeung
  • Computer Science
    Proceedings of the IEEE Information Theory Workshop
  • 2002
Network error-correcting codes for error correction when a source message is transmitted to a set of receiving nodes on a network are introduced.

Network information flow

This work reveals that it is in general not optimal to regard the information to be multicast as a "fluid" which can simply be routed or replicated, and by employing coding at the nodes, which the work refers to as network coding, bandwidth can in general be saved.

Bilinear Forms over a Finite Field, with Applications to Coding Theory

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.