On packet lengths and overhead for random linear coding over the erasure channel

Details On packet lengths and overhead for random linear coding over the erasure channel On packet lengths and overhead for random linear coding over the erasure channel

2007-04-06

arxiv.org/abs/0704.0831v1

Computer Science

Information Theory

5 pages, 5 figures, submitted to the 2007 International Wireless Communications and Mobile Computing Conference

Scientific paper

We assess the practicality of random network coding by illuminating the issue of overhead and considering it in conjunction with increasingly long packets sent over the erasure channel. We show that the transmission of increasingly long packets, consisting of either of an increasing number of symbols per packet or an increasing symbol alphabet size, results in a data rate approaching zero over the erasure channel. This result is due to an erasure probability that increases with packet length. Numerical results for a particular modulation scheme demonstrate a data rate of approximately zero for a large, but finite-length packet. Our results suggest a reduction in the performance gains offered by random network coding.

Affiliated with

Also associated with

No associations

Rating

On packet lengths and overhead for random linear coding over the erasure channel 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 On packet lengths and overhead for random linear coding over the erasure channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On packet lengths and overhead for random linear coding over the erasure channel will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-699561