Publications: 
[1] Fu FangWei, A.J. Han Vinck and Shen ShiYi, On the constructions of constant weight codes, IEEE Transactions on Information Theory, vol.44, no.1, pp.328333, 1998.
[2] Fu FangWei and Shen ShiYi, Hypothesis testing for arbitrary varying source with exponentialtype constraint, IEEE Transactions on Information Theory, vol.44, no.2, pp.892895, 1998.
[3] Fu FangWei and Xia ShuTao, Binary constant weight codes for error detection, IEEE Transactions on Information Theory, vol.44, no.3, pp.12941299, 1998.
[4] Fu FangWei and A.J. Han Vinck, On the capacity of generalized writeonce memory with state transitions described by an arbitrary directed acyclic graph, IEEE Transactions on Information Theory, vol.45, no.1, pp.308314, 1999.
[5] Fu FangWei, T. Klove and Shen ShiYi, On the Hamming distance between two i.i.d. random vectors over GF(q), IEEE Transactions on Information Theory, vol.45, no.2, pp.803807, 1999.
[6] Chen Lusheng and Fu FangWei, On the constructions of new resilient functions from old ones, IEEE Transactions on Information Theory, vol.45, no.6, pp.20772082, 1999.
[7] Fu FangWei, T. Klove and Xia ShuTao, The undetected error probability threshold of moutofn codes, IEEE Transactions on Information Theory, vol.46, no.4, pp.15971599, 2000.
[8] Luo Yuan, Fu FangWei and V.K. Wei, On the depth distribution of linear codes, IEEE Transactions on Information Theory, vol.46, no.6, pp.21972203, 2000.
[9] Fu FangWei and R.W. Yeung, On the capacity and errorcorrecting codes of writeefficient memories, IEEE Transactions on Information Theory, vol.46, no.7, pp.22992314, 2000.
[10] Fu FangWei, T. Klove, Luo Yuan and V.K. Wei, On the Svanstrom bound for ternary constant weight codes, IEEE Transactions on Information Theory, vol.47, no.5, pp.20612064, 2001.
[11] C. Ding, Fu FangWei, T. Klove, and V.K. Wei, Constructions of permutation arrays, IEEE Transactions on Information Theory, vol.48, no.4, pp.977980, 2002.
[12] Fu FangWei and R.W. Yeung, On the ratedistortion region for multiple descriptions, IEEE Transactions on Information Theory, vol.48, no.7, pp.20122021, 2002.
[13] Fu FangWei, T. Klove, and V.K. Wei, On the undetected error probability for binary codes, IEEE Transactions on Information Theory, vol.49, no.2, pp.382390, 2003.
[14] Luo Yuan, Fu FangWei, A.J. Han Vinck, and W.D. Chen, On constant composition codes over Z_q, IEEE Transactions on Information Theory, vol.49, no.11, pp.30103016, 2003.
[15] Fu FangWei, S. Ling, and C.P. Xing, New lower bounds and constructions for binary codes correcting asymmetric errors, IEEE Transactions on Information Theory, vol.49, no.12, pp.32943299, 2003.
[16] Fu FangWei, A.J. Han Vinck, V.K. Wei, and R.W. Yeung, On the capacity of writeunidirectional memories with nonperiodic codes, IEEE Transactions on Information Theory, vol.50, no.4, pp.649656, 2004.
[17] Fu FangWei and T. Klove, Two constructions of permutation arrays, IEEE Transactions on Information Theory, vol.50, no.5, pp. 881883, 2004.
[18] Xia ShuTao, Fu FangWei, Y. Jiang, and S. Ling, The probability of undetected error for binary constant weight codes, IEEE Transactions on Information Theory, vol.51, no.9, pp.33643373, 2005.
[19] Y.S. Tang, S. Ling, and Fu FangWei, On the reliabilityorderbased decoding algorithms for binary linear block codes, IEEE Transactions on Information Theory, vol.52, no.1, pp.328336, 2006.
[20] Xia ShuTao, Fu FangWei, and S. Ling, A lower bound on the probability of undetected error for binary constant weight codes, IEEE Transactions on Information Theory, vol.52, no.9, pp. 42354243, 2006.
[21] Xia ShuTao and Fu FangWei, Minimum pseudoweight and minimum pseudocodewords of LDPC codes, IEEE Transactions on Information Theory, vol.53, no.1, pp.480485, 2008.
[22] Jiang Yong, Xia ShuTao, and Fu FangWei, Stopping set distributions of some ReedMuller codes, IEEE Transactions on Information Theory, vol.57, no.9, pp.60786088, 2011.
[23] Fu FangWei, V.K. Wei and R.W. Yeung, On the minimum average distance of binary codes: Linear programming approach, Discrete Applied Mathematics, vol.111, no.3, pp.265283, July 2001.
[24] Fu FangWei and V.K. Wei, Selfcomplementary balanced codes and quasisymmetric designs, Designs, Codes and Cryptography, vol.27, no.3, pp.271279, 2002.
[25] Fu FangWei, T. Klove, Luo Yuan, and V.K. Wei, On equidistant constant weight codes, Discrete Applied Mathematics, vol.128, no.1, pp.157164, 2003.
[26] Chen Lusheng, Fu FangWei and V.K. Wei, On the constructions and nonlinearity of binary vectoroutput correlationimmune functions, Journal of Complexity, vol.20, no.23, pp.266283, 2004.
[27] Fu FangWei, H. Niederreiter, and M. Su, The expectation and variance of the joint linear complexity of random periodic multisequences, Journal of Complexity, vol.21, no.6, pp. 804¡ª822, 2005.
[28] Xia ShuTao and Fu FangWei, On the minimum pseudocodewords of LDPC codes, IEEE Communication Letters, vol.10, no.5, pp. 363¡ª365, 2006.
[29] Xia ShuTao and Fu FangWei, On the stopping distance of finite geometry LDPC codes, IEEE Communication Letters, vol.10, no.5, pp. 381¡ª383, 2006.
[30] Fu FangWei and Xia ShuTao, The characterization of binary constant weight codes meeting the bound of Fu and Shen, Designs, Codes and Cryptography, vol.43, no.1, pp. 920, 2007.
[31] Fu FangWei and H. Niederreiter, On the counting function of the lattice profile of periodic sequences, Journal of Complexity, vol.23, no.46, pp. 423435, 2007.
[32] Xia ShuTao and Fu FangWei, Undetected error probability of qary constant weight codes, Designs, Codes and Cryptography, vol.48, no.2, pp. 125140, 2008.
[33] Xia ShuTao, Fu FangWei, and Y. Jiang, On the minimum average distance of binary constant weight codes, Discrete Mathematics, vol.308, no.17, pp.38473859, 2008.
[34] Xia ShuTao and Fu FangWei, Johnson type bounds on constant dimension codes, Designs, Codes and Cryptography, vol.50, no.2, pp. 163172, 2009.
[35] Fu FangWei, H. Niederreiter, and F. Ozbudak, Joint linear complexity of multisequences consisting of linear recurring sequences, Cryptography and Communications, vol.1, no.1, pp. 329, 2009.
[36] Fu FangWei, H. Niederreiter, and F. Ozbudak, Joint linear complexity of arbitrary multisequences consisting of linear recurring sequences, Finite Fields and Their Applications, vol.15, no.4, pp.475496, 2009.
[37] Gao ZhiHan and Fu FangWei, The minimal polynomial over F_{q} of linear recurring sequence over F_{q^{m}}, Finite Fields and Their Applications, vol.15, no.6, pp.774784, 2009.
[38] Gao ZhiHan and Fu FangWei, The minimal polynomial of sequence obtained from componentwise linear transformation of linear recurring sequence, Theoretical Computer Science, vol.411, no.4446, pp.38833893, 2010.
[39] Guang Xuan, and Fu FangWei, The average failure probabilities of random linear network coding, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol.E94A, no.10, pp.19912001, 2011.
[40] Guang Xuan, Fu FangWei£¬and Zhen Zhang, Construction of network error correction codes in packet networks, IEEE Transactions on Information Theory, Accepted for Publication.
