Communication over Finite-Field Matrix Channels

Details Communication over Finite-Field Matrix Channels Communication over Finite-Field Matrix Channels

2008-07-09

arxiv.org/abs/0807.1372v4

Computer Science

Information Theory

24 pages, to be published at the IEEE Transactions on Information Theory

Scientific paper

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(n^2 m) 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.

Affiliated with

Also associated with

No associations

Rating

Communication over Finite-Field Matrix Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Communication over Finite-Field Matrix Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Communication over Finite-Field Matrix Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-687481