DocumentCode
2773369
Title
Sparse network coding with overlapping classes
Author
Silva, Danilo ; Zeng, Weifei ; Kschischang, Frank R.
Author_Institution
Dept. of Electr. & Comput. Eng., Univ. of Toronto, Toronto, ON, Canada
fYear
2009
fDate
15-16 June 2009
Firstpage
74
Lastpage
79
Abstract
This paper presents a novel approach to network coding for distribution of large files. Instead of the usual approach of splitting packets into disjoint classes (also known as generations) we propose the use of overlapping classes. The overlapping allows the decoder to alternate between Gaussian elimination and back substitution, simultaneously boosting the performance and reducing the decoding complexity. Our approach can be seen as a combination of fountain coding and network coding. Simulation results are presented that demonstrate the promise of our approach.
Keywords
decoding; encoding; Gaussian elimination; back substitution; decoder; decoding complexity; overlapping classes; sparse network coding; Application software; Boosting; Decoding; Equations; Galois fields; Linear systems; Network coding; Peer to peer computing; Protocols; Streaming media;
fLanguage
English
Publisher
ieee
Conference_Titel
Network Coding, Theory, and Applications, 2009. NetCod '09. Workshop on
Conference_Location
Lausanne
Print_ISBN
978-1-4244-4723-7
Electronic_ISBN
978-1-4244-4724-4
Type
conf
DOI
10.1109/NETCOD.2009.5191397
Filename
5191397
Link To Document