Further results on coding for reliable communication over packet networks
Authors:
- D.S. LunDLD.S. Lun
- M. MedardMMM. Medard
- R. KoetterRKR. Koetter
- M. EffrosMEM. Effros
- 1 January 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 1848-1852
Abstract
In "On Coding for Reliable Communication over Packet Networks" (Lun, Medard, and Effros, Proc. 42nd Annu. Allerton Conf. Communication, Control, and Computing, 2004), a capacity-achieving coding scheme for unicast or multicast over lossy wireline or wireless packet networks is presented. We extend that paper's results in two ways: First, we extend the network model to allow packets received on a link to arrive according to any process with an average rate, as opposed to the assumption of Poisson traffic with i.i.d. losses that was previously made. Second, in the case of Poisson traffic with i.i.d. losses, we derive error exponents that quantify the rate at which the probability of error decays with coding delayKeywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Minimum-cost multicast over coded packet networksIEEE Transactions on Information Theory, 2006
- Algebraic gossip: a network coding approach to optimal multiple rumor mongeringIEEE Transactions on Information Theory, 2006
- Raptor codes2004
- LT codes2003
- Elements of Information Theory2001
- Fundamentals of Queueing Networks2001
- Discrete Flow Networks: Bottleneck Analysis and Fluid ApproximationsMathematics of Operations Research, 1991