Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
