Abstract
LT codes are practical realization of digital fountain codes, which provides the concept of rateless coding. In this scheme, encoded symbols are generated infinitely from k information symbols. Decoder uses only (1+α)k number of encoded symbols to recover the original information. The degree distribution function in the LT codes helps to generate a random graph also referred as tanner graph. The artifact of tanner graph is responsible for computational complexity and overhead in the LT codes. Intuitively, a well designed degree distribution can be used for an efficient implementation of LT codes. The degree distribution function is studied as a function of power law, and LT codes are classified into two different categories: SFLT and RLT codes. Also, two different degree distributions are proposed and analyzed for SFLT codes which guarantee optimal performance in terms of computational complexity and overhead.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
BYERS J, LUBY M, MITZENMACHER M, REGE A. A digital fountain approach to reliable distribution of bulk data [C]// Proceeding of ACM SIGCOMM. Vancouver, 1998, 55–67.
LUBY M. LT Codes [C]// Proceedings of the 43rd Annual IEEE Symposium on the Foundations of Computer Science. Vancouver, Canada, 2002: 271–280.
TARUS H, BUSH J, IRVINE J, DUNLOP J. Exploiting redundancies to improve performance of LT decoding [C]// Proceeding of the 6th Annual Conference on Communication Networks and Services Research (CNSR 2008). Halifax, 2008, 568–573.
HYYTIÄ E, TIRRONEN T, VIRTAMO J. Optimizing the degree distribution of LT codes with an importance sampling approach [C]// 6th International Workshop on Rare Event Simulation. Bamberg, 2006, 64–73.
ZHU H, ZHANG G, LI G. A novel degree distribution algorithm of LT codes [C]// the 11th IEEE International Conference on Communication Technology. Hangzhou, 2008.
SØRENSEN J H, POPOVSKI P, ØSTERGAARD J. Design and analysis of LT codes with decreasing ripple size [J]. IEEE Transactions on Communication, 2012, 60(11): 3191–3197.
CHEN C. M, CHEN Y P, SHEN T C, ZAO J K. Optimizing the degree distributions in LT codes by using the multi-objective evolutionary algorithm based on decomposition [C]// Proceeding of the IEEE Congress on Evolutionary Computation. Barcelona, 2010, 3635–3642.
CHEN C M, CHEN Y P, SHEN T C, ZAO J K. A practical optimization frame for the degree distribution in LT codes [R]. NCLab Report No. NCL-TR-2011001, 2011.
BARABASI A L, DEZSO Z, RAVASZ E, YOOK S H, OLTVAI Z. Scale free and hierarchical structures in complex networks [C]// American Institute of Physics (AIP) Conference Proceedings. Granada, 2002: 1–16.
NEWMAN M E J. Power laws pareto distributions and Zipf’s law [J]. Contemporary Physics, 2005, 46(5): 323–351.
LEI Min, ZHAO Oing-gui, HOU Zheng-ting. Three vertex degree correlations of fixed act-size collaboration networks [J]. Journal of Central South University, 2011, 18(3): 830–833.
STOCKHAMMER T, JENKAC H, MAYER T, XU W. Soft decoding of LT codes for wireless broadcast [C]// Proceeding of IST Mobile. Dresden, Germany, 2005, 262–264.
UYEDA F, XIA H, CHEN A A. Evaluation of a high performance erasure code implementation [R]. University of California, San Diego, 2004.
Author information
Authors and Affiliations
Corresponding author
Additional information
Foundation item: This work was supported by Research Fund Chosun Univerity, 2011
Rights and permissions
About this article
Cite this article
Muhammad, A., GoangSeog, C. An optimized framework for degree distribution in LT codes based on power law. J. Cent. South Univ. 20, 2693–2699 (2013). https://doi.org/10.1007/s11771-013-1785-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11771-013-1785-3