An Analysis of Finite-Memory Random Linear Coding on Packet Streams
Authors:
- D.S. LunDLD.S. Lun
- P. PakzadPPP. Pakzad
- C. FragouliCFC. Fragouli
- M. MedardMMM. Medard
- R. KoetterRKR. Koetter
- 8 August 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Abstract
We consider the following packet coding scheme: The coding node has a fixed, finite memory in which it stores packets formed from an incoming packet stream, and it sends packets formed from random linear combinations of its memory contents. We analyze the scheme in two settings: as a self- contained component in a network providing reliability on a single link, and as a component employed at intermediate nodes in a block-coded end-to-end connection. We believe that the scheme is a good alternative to automatic repeat request when feedback is too slow, too unreliable, or too difficult to implement.Keywords
This publication has 6 references indexed in Scilit:
- On coding for reliable communication over packet networksPhysical Communication, 2008
- Algebraic gossip: a network coding approach to optimal multiple rumor mongeringIEEE Transactions on Information Theory, 2006
- Reliability Analysis of a Convolutional-Code-Based Packet Level FEC under Limited Buffer SizeIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2005
- Coding schemes for line networks2005
- Further results on coding for reliable communication over packet networks2005
- Raptor codes2004