Online Fountain Codes With Low Overhead

An online fountain code is defined as a fountain code for which an optimal encoding strategy can be found efficiently given any instantaneous decoding state. This property is important for data distribution in practical networks. In this paper, we formalize the problem of online fountain code construction, and propose new online fountain codes that outperform known ones in having factor 3-5 lower redundancy overhead. The bounding of the code overhead is carried out using the analysis of the dynamics of random-graph processes.


Published in:
Ieee Transactions On Information Theory, 61, 6, 3137-3149
Year:
2015
Publisher:
Piscataway, Institute of Electrical and Electronics Engineers
ISSN:
0018-9448
Keywords:
Laboratories:




 Record created 2015-09-28, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)