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

Authors:
Brooke Shrader;Anthony Ephremides
Affiliations:
University of Maryland, College Park, MD;University of Maryland, College Park, MD
Venue:
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Year:
2007

Citing 4
Cited 1

Network information flow

IEEE Transactions on Information Theory
Linear network coding

IEEE Transactions on Information Theory
Polynomial time algorithms for multicast network code construction

IEEE Transactions on Information Theory
Capacity of wireless erasure networks

IEEE Transactions on Information Theory

On broadcast stability of queue-based dynamic network coding over erasure channels

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.06

Visualization

Abstract

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.