Coding for Network Coding

Abstract

We consider communication over a noisy network under randomized linear network coding. Possible error mechanism include node- or link- failures, Byzantine behavior of nodes, or an over-estimate of the network min-cut. Building on the work of Koetter and Kschischang, we introduce a probabilistic model for errors. We compute the capacity of this channel and we define an error-correction scheme based on random sparse graphs and a low-complexity decoding algorithm. By optimizing over the code degree profile, we show that this construction achieves the channel capacity in complexity which is jointly quadratic in the number of coded information bits and sublogarithmic in the error probability.

12 pages, 2 ps figures

References in corpus (1)

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

Cited by in corpus (7)

• Spread Codes and Spread Decoding in Network Coding
• Communication over Finite-Field Matrix Channels
• Rank Minimization over Finite Fields: Fundamental Limits and Coding-Theoretic Interpretations
• Network Coding Security: Attacks and Countermeasures
• On the Capacity of Non-Coherent Network Coding
• Spatially-Coupled Binary MacKay-Neal Codes for Channels with Non-Binary Inputs and Affine Subspace Outputs
• Non-Binary LDPC Codes with Large Alphabet Size