Investigation on Digital Fountain Codes over Erasure Channels and Additive White Gaussian Noise Channels

[1]  D.J.C. MacKay,et al.  Good error-correcting codes based on very sparse matrices , 1997, Proceedings of IEEE International Symposium on Information Theory.

[2]  Khaled A. S. Abdel-Ghaffar,et al.  Complete Enumeration of Stopping Sets of Full-Rank Parity-Check Matrices of Hamming Codes , 2007, IEEE Transactions on Information Theory.

[3]  David J. C. MacKay,et al.  Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check cCodes , 2003, MFCSIT.

[4]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[5]  Michael Luby,et al.  LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[6]  Michael Luby,et al.  A digital fountain approach to reliable distribution of bulk data , 1998, SIGCOMM '98.

[7]  Huanlin Li,et al.  A New Approach to Enumerating the Smallest Stopping Sets in LDPC Codes , 2010 .

[8]  Alex M. Andrew,et al.  INFORMATION THEORY, INFERENCE, AND LEARNING ALGORITHMS, by David J. C. MacKay, Cambridge University Press, Cambridge, 2003, hardback, xii + 628 pp., ISBN 0-521-64298-1 (£30.00) , 2004, Robotica.

[9]  Hano Wang.  Hardware Designs for LT Coding , 2006 .

[10]  H. Leib,et al.  Fixed-Rate Raptor Code Performance Over Correlated Rayleigh Fading Channels , 2007, 2007 Canadian Conference on Electrical and Computer Engineering.

[11]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[12]  Alexander Vardy,et al.  On the stopping distance and the stopping redundancy of codes , 2006, IEEE Transactions on Information Theory.

[13]  Marco Chiani,et al.  Performance versus overhead for fountain codes over Fq , 2010, IEEE Communications Letters.

[14]  Thomas Stockhammer,et al.  Soft Decoding of LT-Codes for Wireless Broadcast , 2005 .

[15]  Weizheng Huang,et al.  Fountain codes with message passing and maximum likelihood decoding over erasure channels , 2011, 2011 Wireless Telecommunications Symposium (WTS).

[16]  Shu Lin,et al.  Low-density parity-check codes based on finite geometries: A rediscovery and new results , 2001, IEEE Trans. Inf. Theory.

[17]  Harry Leib,et al.  Fixed-Rate Raptor Codes Over Rician Fading Channels , 2008, IEEE Transactions on Vehicular Technology.

[18]  Ajay Dholakia,et al.  Efficient implementations of the sum-product algorithm for decoding LDPC codes , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[19]  Michael Mitzenmacher,et al.  Accessing multiple mirror sites in parallel: using Tornado codes to speed up downloads , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[20]  Marco Chiani,et al.  Low-Complexity LDPC Codes with Near-Optimum Performance over the BEC , 2008, 2008 4th Advanced Satellite Mobile Systems.

[21]  Emre Telatar,et al.  Finite-length analysis of low-density parity-check codes on the binary erasure channel , 2002, IEEE Trans. Inf. Theory.

[22]  Joachim Hagenauer,et al.  Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.

[23]  Alon Orlitsky,et al.  Stopping set distribution of LDPC code ensembles , 2003, IEEE Transactions on Information Theory.

[24]  Vincent Roca,et al.  Improving the Decoding of LDPC Codes for the Packet Erasure Channel with a Hybrid Zyablov Iterative Decoding/Gaussian Elimination Scheme , 2008 .

[25]  Marc P. C. Fossorier,et al.  Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices , 2004, IEEE Trans. Inf. Theory.

[26]  Jonathan S. Yedidia,et al.  Rateless codes on noisy channels , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[27]  David J. C. MacKay,et al.  Comparison of constructions of irregular Gallager codes , 1999, IEEE Trans. Commun..

[28]  Richard D. Wesel,et al.  Construction of irregular LDPC codes with low error floors , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[29]  Omid Etesami,et al.  Raptor codes on binary memoryless symmetric channels , 2006, IEEE Transactions on Information Theory.

[30]  Thomas J. Richardson,et al.  Error Floors of LDPC Codes , 2003 .

[31]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[32]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

[33]  Shu Lin,et al.  Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking , 2007, IEEE Transactions on Information Theory.

[34]  V. Rathi,et al.  On the Asymptotic Weight and Stopping Set Distribution of Regular LDPC Ensembles , 2005, IEEE Transactions on Information Theory.

[35]  Amin Shokrollahi,et al.  LDPC Codes: An Introduction , 2004 .

[36]  Weizheng Huang,et al.  Digital Fountain Codes System Model and Performance over AWGN and Rayleigh Fading Channels , 2009 .

[37]  Sae-Young Chung,et al.  An efficient algorithm for ML decoding of raptor codes over the binary erasure channel , 2008, IEEE Communications Letters.

[38]  Edgar Martínez-Moro,et al.  An Introduction to LDPC Codes , 2013 .

[39]  Rüdiger L. Urbanke,et al.  Efficient encoding of low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[40]  Kevin T. Phelps,et al.  Coding Theory and Cryptography : The Essentials , 2022 .

[41]  Khaled A. S. Abdel-Ghaffar,et al.  Stopping Set Enumerators of Full-Rank Parity-Check Matrices of Hamming Codes , 2006, 2006 IEEE International Symposium on Information Theory.

[42]  Joong Bum Rhim,et al.  Fountain Codes , 2010 .

[43]  Daniel A. Spielman,et al.  Efficient erasure correcting codes , 2001, IEEE Trans. Inf. Theory.

[44]  Emina Soljanin,et al.  Asymptotic Spectra of Trapping Sets in Regular and Irregular LDPC Code Ensembles , 2007, IEEE Transactions on Information Theory.

[45]  Daniel A. Spielman,et al.  Practical loss-resilient codes , 1997, STOC '97.

[46]  Michael Mitzenmacher,et al.  Digital fountains: a survey and look forward , 2004, Information Theory Workshop.

[47]  C.E. Shannon,et al.  Communication in the Presence of Noise , 1949, Proceedings of the IRE.

[48]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.