Improved online fountain codes

Yuli Zhao, Yin Zhang, Francis C.M. Lau, Hai Yu, Zhiliang Zhu

Research output: Journal article publicationJournal articleAcademic researchpeer-review

13 Citations (Scopus)


Online fountain codes have been proven to require lower overhead and fewer feedbacks than growth codes for successful decoding. In an attempt to improve the intermediate symbol recovery rate, the authors propose sending a number of degree-1 input symbols prior to the build-up phase based on a simple application of probability theory. In addition, during the completion phase, received encoded symbols with three neighbouring white (un-decoded) symbols are retained for decoding and updating the decoding graph later. The performance and characteristics of the proposed improved online fountain codes are compared to those of the original online fountain codes over an erasure channel. Simulation results reveal that the improved online fountain codes outperform the original fountain codes in terms of intermediate symbol recovery rate, average encoded symbols required to be generated by the sender, average feedback transmissions, and encoding/decoding efficiency.

Original languageEnglish
Pages (from-to)2297-2304
Number of pages8
JournalIET Communications
Issue number18
Publication statusPublished - 1 Jan 2018

ASJC Scopus subject areas

  • Computer Science Applications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Improved online fountain codes'. Together they form a unique fingerprint.

Cite this