LT codes decoding: design and analysis

Authors:
Feng Lu;Chuan Heng Foh;Jianfei Cai;Liang-Tien Chia
Affiliations:
Electrical and Computer Engineering Department, University of California, San Diego;School of Computer Engineering, Nanyang Technological University, Singapore;School of Computer Engineering, Nanyang Technological University, Singapore;School of Computer Engineering, Nanyang Technological University, Singapore
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Year:
2009

Citing 6
Cited 0

Matrix analysis

Matrix analysis
Solving sparse linear equations over finite fields

IEEE Transactions on Information Theory
A digital fountain approach to reliable distribution of bulk data

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
LT Codes

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Raptor codes

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

LT codes provide an efficient way to transfer information over erasure channels. Past research has illustrated that LT codes can perform well for a large number of input symbols. However, it is shown that LT codes have poor performance when the number of input symbols is small. We notice that the poor performance is due to the design of the LT decoding process. In this respect, we present a decoding algorithm called full rank decoding that extends the decodability of LT codes by using Wiedemann algorithm. We provide a detailed mathematical analysis on the rank of the random coefficient matrix to evaluate the probability of successful decoding for our proposed algorithm. Our studies show that our proposed method reduces the overhead significantly in the cases of small number of input symbols yet preserves the sim plicity of the original LT decoding process.