| [1] Elias P. Coding for Two Noisy Channels [C]//Proc Third London Symp. Information Theory. London: Buttersworth's Scientific Publications, 1955: 61-76.
[2] Peng X H. Erasure-control Coding for Distributed Networks [J]. IEE Proceedings Communications, 2005, 152(6): 1075-1080.
[3] Mu Jianjun. Performance Analysis of Regular Low-density Erasure Codes [J]. Chinese Journal of Electronics, 2008, 17(2): 377-380.
[4] Shokrollahi A. Capacity-achieving Sequences [C]//Codes, Systems and Graphical Models (IMA Volumes in Mathematics and Its Applications). Berlin: Springer-Verlag, 2000: 153-166.
[5] Oswald P, Shokrollahi M A. Capacity-achieving Sequences for the Erasure Channel [J]. IEEE Trans on Inform Theory, 2002, 48(12): 3017- 3028.
[6] Richardson T, Shokrollahi A, Urbanke R. Design of Capacity Approaching Irregular Low-density Parity-check Codes [J]. IEEE Trans on Inform Theory, 2001, 47(2): 619-637.
[7] Vellambi B N, Fekri F. Results on the Improved Decoding Algorithm for Low-density Parity-check Codes over the Binary Erasure Channel [J]. IEEE Trans on Inform Theory, 2007, 53(4): 1510-1520.
[8] Luby M G, Mitzenmacher M, Shokrollahi M A, et al. Efficient Erasure Correcting Codes [J]. IEEE Trans on Inform Theory, 2001, 47(2): 569-584.
[9] 陈汝伟, 黄华伟, 杜小妮, 等. Tanner图中最短圈的计数[J]. 西安电子科技大学学报, 2008, 35(6): 983-985.
Chen Ruwei, Huang Huawei, Du Xiaoni, et al. On the Number of Shortest Cycles of Tanner Graphs [J]. Journal of Xidian University, 2008, 35(6): 983-985.
[10] Woitaszek M, Tufo H M. Tornado Codes for MAID Archival Storage [C]//Proceedings of the 24th IEEE Conference on Mass Storage Systems and Technologies (MSST 2007). California: IEEE Computer Society, 2007: 221-226. |
