Coding for Errors and Erasures in Random Network Coding

@article{Koetter2008CodingFE,
  title={Coding for Errors and Erasures in Random Network Coding},
  author={Ralf Koetter and Frank R. Kschischang},
  journal={IEEE Transactions on Information Theory},
  year={2008},
  volume={54},
  pages={3579-3591}
}
The problem of error-control in random linear network coding is considered. A ldquononcoherentrdquo or ldquochannel obliviousrdquo model is assumed where neither transmitter nor receiver is assumed to have knowledge of the channel transfer characteristic. Motivated by the property that linear network coding is vector-space preserving, information transmission is modeled as the injection into the network of a basis for a vector space V and the collection by the receiver of a basis for a vector… 

Figures from this paper

Iterative Coding for Network Coding
TLDR
A systematic oblivious random channel model based on random sparse graphs and a low-complexity decoding algorithm is introduced that achieves the channel capacity in complexity which is jointly quadratic in the number of coded information bits and sublogarithmic in the error probability.
On Metrics for Error Correction in Network Coding
TLDR
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.
Performance evaluation of constant dimension subspace code for error and erasures correcting in linear network coding
TLDR
This paper evaluates the performance of such constant dimension subspace code for random and deterministic network coding in terms of packet error rate (P.E.R.) in the context of a noncoherent transmission model for random linear network coding.
Communication Over Finite-Field Matrix Channels
TLDR
A simple coding scheme is presented that achieves capacity in both limiting cases and has a probability of error that decreases exponentially both in the packet length and in the field size in bits.
A Rank-Metric Approach to Error Control in Random Network Coding
TLDR
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.
Algebraic list-decoding on the operator channel
TLDR
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.
Research Statement 1 of 4 Subspace Codes for Random Network Coding 1 Classical Coding Theory ?
TLDR
Algebraic coding theory studies the balance between adding mathematical redundancy to data versus the cost of sending the redundancy, and how to decode the received word to the closest codeword.
Universal secure error-correcting schemes for network coding
TLDR
This paper considers the problem of securing a linear network coding system against an adversary that is both an eavesdropper and a jammer and proposes a scheme that can achieve the maximum rate, for any n and any field size q, provided the packet length m is at least n symbols.
Hybrid Noncoherent Network Coding
TLDR
This work describes a novel extension of subspace codes for noncoherent networks, suitable for use when the network is viewed as a communication system that introduces both dimension and symbol errors, and derives two upper bounds on the size of the codes.
Grassmannian Codes with New Distance Measures for Network Coding
  • T. Etzion, Hui Zhang
  • Computer Science
    2018 IEEE International Symposium on Information Theory (ISIT)
  • 2018
TLDR
It is proved that each code with the largest number of codewords and the generalized distance, given the other parameters, has the minimum requirements needed to solve a given multicast network with a scalar linear code.
...
...

References

SHOWING 1-10 OF 62 REFERENCES
A Rank-Metric Approach to Error Control in Random Network Coding
TLDR
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.
Using Rank-Metric Codes for Error Correction in Random Network Coding
TLDR
It is shown that the error correction problem in random network coding is closely related to a generalized decoding problem for rank-metric codes, and an efficient decoding algorithm is proposed that can correct e errors, mu erasures and v deviations.
Zero-error network coding for acyclic network
TLDR
The results in this paper can be regarded as zero-error network coding theorems for acyclic communication networks and inner and outer bounds on the zero- error admissible coding rate region are obtained in term of the regions /spl Gamma//sub N//sup */ and /spl gamma/~/sub N/sup */, which are fundamental regions in the entropy space defined by Yeung.
Communication on the Grassmann manifold: A geometric approach to the noncoherent multiple-antenna channel
TLDR
The capacity of multiple-antenna fading channels is studied using a noncoherent block fading model proposed by Marzetta and Hochwald and has a geometric interpretation as sphere packing in the Grassmann manifold.
NETWORK ERROR CORRECTION, PART II: LOWER BOUNDS
TLDR
The paradigm of network error correction as a generalization of classical link-by-link error correction was introduced and the network generalizations of the Hamming bound and the Singleton bound in classical algebraic coding theory were obtained.
Theory of Error-correcting Codes
TLDR
This course expounds the principles of coded modulations for the Gaussian channel and, if time permits, for Rician and Rayleigh fading channels (fully interleaved), and reminds students of the basics of the theory of linear codes for conventional memoryless ergodic channels.
Resilient network codes in the presence of eavesdropping Byzantine adversaries
  • S. Jaggi, M. Langberg
  • Computer Science
    2007 IEEE International Symposium on Information Theory
  • 2007
TLDR
This work improves on previous work by providing a polynomial- time, rate-optimal distributed network code design that functions even in the presence of a Byzantine adversary with substantial eavesdropping capabilities.
Resilient network coding in the presence of Byzantine adversaries
  • S. Jaggi, M. Langberg, M. Effros
  • Computer Science
    IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications
  • 2007
TLDR
This paper introduces the first distributed polynomial-time rate-optimal network codes that work in the presence of Byzantine nodes, and presents algorithms that target adversaries with different attacking capabilities.
Introduction to coding theory
TLDR
This 2006 book introduces the reader to the theoretical foundations of error-correcting codes, with an emphasis on Reed-Solomon codes and their derivative codes, and is designed to be accessible to a broad readership, from senior-undergraduate to graduate level.
Johnson type bounds on constant dimension codes
TLDR
It is shown that Steiner structures are optimal constant dimension codes achieving the Wang-Xing-Safavi-Naini bound and it is pointed out that a family of known Steiner structure is actually afamily of optimal constantdimension codes achieving both the Johnson type bounds I and II.
...
...