LT codes are the first class of fountain codes which are rateless erasure sparse graph codes. Such codes generate an unlimited amount of encoded symbols and transmit them, that's make them a good candidate for future transmissions. At the receiver, any number of the encoded symbols received which is equal or slightly greater than the number of the original symbols is sufficient to successfully decode the original data. The performance of such codes depends directly on the degree distribution chosen which we will focus on. In this paper, we analyze LT codes with their degree of distribution.
机构:
KTH Royal Inst Technol, Sch Elect Engn, S-10044 Stockholm, Sweden
KTH Royal Inst Technol, ACCESS Linnaeus Ctr, S-10044 Stockholm, SwedenKTH Royal Inst Technol, Sch Elect Engn, S-10044 Stockholm, Sweden
Hussain, Iqbal
Xiao, Ming
论文数: 0引用数: 0
h-index: 0
机构:
KTH Royal Inst Technol, Sch Elect Engn, S-10044 Stockholm, Sweden
KTH Royal Inst Technol, ACCESS Linnaeus Ctr, S-10044 Stockholm, SwedenKTH Royal Inst Technol, Sch Elect Engn, S-10044 Stockholm, Sweden
Xiao, Ming
Rasmussen, Lars Kildehoj
论文数: 0引用数: 0
h-index: 0
机构:
KTH Royal Inst Technol, Sch Elect Engn, S-10044 Stockholm, Sweden
KTH Royal Inst Technol, ACCESS Linnaeus Ctr, S-10044 Stockholm, Sweden
Univ S Australia, Inst Telecommun Res, Adelaide, SA 5095, AustraliaKTH Royal Inst Technol, Sch Elect Engn, S-10044 Stockholm, Sweden