R. Li, R.W. Yeung, and N. Cai, “Linear Network Coding,” IEEE Trans. Inf. Theory, vol. 49, no. 2, pp. 371–381, February 2003.[2] C. Fragouli, J.-Y.L. Boudec, and J.Widmer, “Network coding: an instant primer,” ACM SIGCOMM Comput. Common. Rev., no. 1, January 2006.[3] J. Huang, S. Zhou, and P. Willett, “Linear-time encodeable nonbinary irregular LDPC codes near the Shannon limit,” in Proc. 2009 IEEE GLOBECOM, pages 867–872.[4] RG Gallager, Low-Density Parity Check Codes. MIT Press, 1963.[5] A.Bennatan and D. Burshtein, “Design and Analysis of Nonbinary LDPC Codes for Memoryless Discrete Arbitrary Channels,” IEEE Trans. Inf. Theory, vol. 52, February 2006.[6] F.R.K.schischang, B. Frey and H.-A. Loeliger, “Factor graphs and the sum-product algorithm,” IEEE Trans.Inf. Theory, vol. 42, page. 498–519, February 2001.[7] A. Chakrabarti, A. de Baynast, A. Sabharwal and B. Aazhang. Designing LDPC code for half-duplex decoding and forwarding. In the Proc. 43rd Allerton Conference on Communication, Control and Computing, September 2005.[8] X. Qin and R. Berry, “Opportunistic splitting algorithms for wireless networks,” in Proc. 2004 INFOCOM, pp..