Generation of luby transform codes with low redundancy

Yuli Zhao, Chung Ming Lau, Zhiliang Zhu, Wei Zhang

Research output: Journal article publicationJournal articleAcademic researchpeer-review

1 Citation (Scopus)


Given the same number of encoded symbols, a Luby Transform (LT) decoder is more likely to decode successfully when there is little redundancy among the symbols. With the use of a Tanner graph, we describe two kinds of redundancy appearing in LT codes in this paper. We further propose an encoding algorithm called Low Redundancy (LR) algorithm used in the formation of the encoded symbols. The algorithm aims to reduce the redundancy of LT codes and to improve the decoder performance under the same complexity. Simulation results show various LT codes improve in terms of average overhead factor and probability of successful decoding when the codes are encoded using the proposed LR algorithm. Moreover, the encoding complexity remains unchanged.
Original languageEnglish
Article number1550072
JournalInternational Journal of Bifurcation and Chaos
Issue number5
Publication statusPublished - 26 May 2015


  • Binary erasure channel
  • low redundancy
  • Luby transform code
  • Tanner graph

ASJC Scopus subject areas

  • Modelling and Simulation
  • Applied Mathematics


Dive into the research topics of 'Generation of luby transform codes with low redundancy'. Together they form a unique fingerprint.

Cite this