Finite Length Analysis of Fountain Codes Based on Stopping Set

[1] Byers J W, Luby M, and Mitzenmacher M, et al.. A digitalfountain approach to reliable distribution of bulk data. Proc.ACM SIG-COMM, Vancouver, BC, Canada, 1998: 56-67. [2] Luby M, Mitzenmacher M, and Shokrollahi A, et al..Practical loss-resilient codes. Proc. 29th ACM Sym-posiumon Theory of Computing, Texas, 1997: 150-159. [3] Luby M, Mitzenmacher M, and Shokrollahi A, et al.. Efficienterasure correcting codes[J].IEEE Trans. on Inform. Theory.2001, 47(2):569-584 [4] Luby M, Mitzenmacher M, and Shokrollahi A. Analysis ofrandom processes via and-or tree evaluation. Proc. 9th Annu.ACM-SIAM Symp. Discrete Algorithms, San Francisco, CA,1998: 364-373. [5] Di C, Proietti D, and Telatar I E, et al.. Finite-length analysisof low-density parity-check codes on the binary erasurechannel[J].IEEE Trans. on Inform. Theory.2002, 48(6):1570-1579 [6] Shokrollahi A. Raptor codes[J].IEEE Trans. on Inform. Theory.2006, 52(6):2551-2567 [7] MacKay D J C. Fountain codes[J].IEEE Proc-Commun.2005,152(6):1062-1068 [8] Orlitsky A, Viswanathan K, and Zhang J. Stopping setdistribution of LDPC code ensembles[J].IEEE Trans. onInform. Theory.2005, 51(3):929-953 [9] Hu X Y, Eleftheriou E, and Arnold D M. Regular andirregular progressive edge-growth tanner graphs[J].IEEE Trans.on Inform. Theory.2005, 51(1):386-398