Communication over finite-field matrix channels

Authors:
Danilo Silva;Frank R. Kschischang;Ralf Kötter
Affiliations:
The Edward S. Rogers Sr. Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, Canada;The Edward S. Rogers Sr. Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, Canada;Institute for Communications Engineering, TU Muenchen, Muenchen, Germany
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 9
Cited 1

Elements of information theory

Elements of information theory
An algebraic approach to network coding

IEEE/ACM Transactions on Networking (TON)
On metrics for error correction in network coding

IEEE Transactions on Information Theory
Network information flow

IEEE Transactions on Information Theory
Linear network coding

IEEE Transactions on Information Theory
A Random Linear Network Coding Approach to Multicast

IEEE Transactions on Information Theory
Resilient Network Coding in the Presence of Byzantine Adversaries

IEEE Transactions on Information Theory
Coding for Errors and Erasures in Random Network Coding

IEEE Transactions on Information Theory
A Rank-Metric Approach to Error Control in Random Network Coding

IEEE Transactions on Information Theory

Compressed error and erasure correcting codes via rank-metric codes in random network coding

International Journal of Communication Systems

Quantified Score

Hi-index	754.84

Visualization

Abstract

This paper is motivated by the problem of error control in network coding when errors are introduced in a random fashion (rather than chosen by an adversary). An additive-multiplicative matrix channel is considered as a model for random network coding. The model assumes that n packets of length m are transmitted over the network, and up to t erroneous packets are randomly chosen and injected into the network. Upper and lower bounds on capacity are obtained for any channel parameters, and asymptotic expressions are provided in the limit of large field or matrix size. A simple coding scheme is presented that achieves capacity in both limiting cases. The scheme has decoding complexity O(n2m) and a probability of error that decreases exponentially both in the packet length and in the field size in bits. Extensions of these results for coherent network coding are also presented.