Inactivation Decoding of LT and Raptor Codes: Analysis and Code Design
arXiv:1706.05814 · doi:10.1109/TCOMM.2017.2715805
Abstract
In this paper we analyze LT and Raptor codes under inactivation decoding. A first order analysis is introduced, which provides the expected number of inactivations for an LT code, as a function of the output distribution, the number of input symbols and the decoding overhead. The analysis is then extended to the calculation of the distribution of the number of inactivations. In both cases, random inactivation is assumed. The developed analytical tools are then exploited to design LT and Raptor codes, enabling a tight control on the decoding complexity vs. failure probability trade-off. The accuracy of the approach is confirmed by numerical simulations.
Accepted for publication in IEEE Transactions on Communications
References in corpus (2)
Cited by in corpus (7)
- Bounds on the Error Probability of Raptor Codes under Maximum Likelihood Decoding
- Successive Cancellation Inactivation Decoding for Modified Reed-Muller and eBCH Codes
- Performance Bounds and Degree-Distribution Optimization of Finite-Length BATS Codes
- Rateless Codes for Low-Latency Distributed Inference in Mobile Edge Computing
- Caching at the Edge with LT codes
- Combinatorial Solution of the Syndrome Decoding Problem using Copula on Grassmann graph
- Efficient Belief Propagation List Ordered Statistics Decoding of Polar Codes