Paper Info
Title
Rateless codes from spatially coupled regular-LT codes
Abstract
In this paper, we study the performance of spatially coupled LT (SC-LT) codes under low-complexity belief-propagation (BP) decoding when the transmission is over a binary erasure channel (BEC). We derive a tight upper bound and lower bound on the asymptotic error probability of these rateless codes in terms of overhead and the check degree in the limit of block-length. We show that for a given overhead, the error probability of SC-LT codes is independent of erasure probability of channel and decays exponentially fast in the check degree. We show that the channel capacity can be approached by using a high-rate precoder.
Year
DOI
Venue
2015
10.1109/IWCIT.2015.7140204
2015 Iran Workshop on Communication and Information Theory (IWCIT)
Keywords
Field
DocType
rateless code,spatially coupled regular-LT code,SC-LT code,low-complexity belief propagation decoding,BP decoding,binary erasure channel,BEC,asymptotic error probability,channel capacity,high-rate precoder
Online codes,Concatenated error correction code,Luby transform code,Fountain code,Low-density parity-check code,Algorithm,Binary erasure channel,Theoretical computer science,Raptor code,Erasure code,Mathematics
Conference
ISSN
Citations 
PageRank 
2374-3212
0
0.34
References 
Authors
10
1
Name
Order
Citations
PageRank
Vahid Aref1586.49