Home | About CIM | In Memory of Chern | Affiliations | Lectures | Conferences | Visitors | Library of Mathematics  | Graduates | International Cooperations | Videos 

 
 
About CIM
 
Home > About CIM > Faculty > Fu Fangwei

Fangwei Fu

http://192.168.150.81:8080/_vsl/A3B6A60C8DFBD0DAC19F55FB5039E0F7/27AF1951/165E3?e=.jpg

 

Name

Fangwei Fu 

Specialty

Applied Mathematics

Position

Professor of Chern Institute of Mathematics

Curriculum Vitae

9.1980-7.1984: Bachelor Degree, Department of Mathematics, Nankai University

9.1984-7.1987: Master Degree, Department of Mathematics, Nankai University

9.1987-12.1990: Ph.D Degree, Department of Mathematics, Nankai University

10.1989-10.1990: Research Assistant in joint Ph.D program, Department of Mathematics, University of Bielefeld , Germany

7.1987-4.2007: Lecturer (7.1989), Associate Professor (12.1993), Professor (12.1995), Ph. D Supervisor (1.1997), School of Mathematical Science, Nankai University

10.1996-10.1997: Visiting Scholar, Institute for Experimental Mathematics, University of Essen, Germany

10.1998-1.1999, 7.1999-10.1999, 4.2000-10.2000, 7.2001-2.2002: Visiting Scholar, Dept. of Information Engineering, The Chinese University of Hong Kong

2.2002-3.2007: Research Scientist A, Temasek Laboratories, National University of Singapore , Singapore

4.2007-Present: Professor, Chern Institute of Mathematics, Nankai University

Research Interest

Coding Theory, Cryptography, Information Theory

Publications

[1] Fu Fang-Wei, A.J. Han Vinck and Shen Shi-Yi, On the constructions of constant   weight codes, IEEE Transactions on Information Theory, vol.44, no.1, pp.328-333, 1998.

[2] Fu Fang-Wei and Shen Shi-Yi, Hypothesis testing for arbitrary varying source   with exponential-type constraint, IEEE Transactions on Information Theory,   vol.44, no.2, pp.892-895, 1998.

[3] Fu Fang-Wei and Xia Shu-Tao, Binary constant weight codes for error detection, IEEE Transactions on Information Theory, vol.44, no.3,   pp.1294-1299, 1998.

[4] Fu Fang-Wei and A.J. Han Vinck, On the capacity of generalized write-once  memory with state transitions described by an arbitrary   directed acyclic graph, IEEE Transactions on Information Theory, vol.45,   no.1, pp.308-314, 1999.

[5] Fu Fang-Wei, T. Klove and Shen Shi-Yi, On the Hamming distance between two   i.i.d. random vectors over GF(q), IEEE Transactions on Information Theory,   vol.45, no.2, pp.803-807, 1999.

[6] Chen Lusheng and Fu Fang-Wei, On the constructions of new resilient functions   from old ones, IEEE Transactions on Information Theory, vol.45, no.6, pp.2077-2082, 1999.

[7] Fu Fang-Wei, T. Klove and Xia Shu-Tao, The undetected error probability   threshold of m-out-of-n codes, IEEE Transactions on Information Theory, vol.46, no.4, pp.1597-1599, 2000.

[8] Luo Yuan, Fu Fang-Wei and V.K. Wei, On the depth distribution of linear   codes, IEEE Transactions on Information Theory, vol.46, no.6, pp.2197-2203, 2000.

[9] Fu Fang-Wei and R.W. Yeung, On the capacity and error-correcting codes of   write-efficient memories, IEEE Transactions on Information Theory, vol.46, no.7, pp.2299-2314, 2000.

[10] Fu Fang-Wei, 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.2061-2064, 2001.

[11] C. Ding, Fu Fang-Wei, T. Klove, and V.K. Wei, Constructions of permutation   arrays, IEEE Transactions on Information Theory, vol.48, no.4, pp.977-980,   2002.

[12] Fu Fang-Wei and R.W. Yeung, On the rate-distortion region for multiple descriptions, IEEE Transactions on Information Theory, vol.48, no.7, pp.2012-2021, 2002.

[13] Fu Fang-Wei, T. Klove, and V.K. Wei, On the undetected error probability for   binary codes, IEEE Transactions on Information Theory, vol.49, no.2, pp.382-390, 2003.

[14] Luo Yuan, Fu Fang-Wei, 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.3010-3016, 2003.

[15] Fu Fang-Wei, 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.3294-3299, 2003.

[16] Fu Fang-Wei, A.J. Han Vinck, V.K. Wei, and R.W. Yeung, On the capacity of write-unidirectional   memories with nonperiodic codes, IEEE Transactions on Information Theory,   vol.50, no.4, pp.649-656, 2004.

[17] Fu Fang-Wei and T. Klove, Two constructions of permutation arrays, IEEE   Transactions on Information Theory, vol.50, no.5, pp. 881-883, 2004.

[18] Xia Shu-Tao, Fu Fang-Wei, 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.3364-3373, 2005.

[19] Y.S. Tang, S. Ling, and Fu Fang-Wei, On the reliability-order-based decoding   algorithms for binary linear block codes, IEEE Transactions on Information   Theory, vol.52, no.1, pp.328-336, 2006.

[20] Xia Shu-Tao, Fu Fang-Wei, 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. 4235-4243, 2006.

[21] Xia Shu-Tao and Fu Fang-Wei, Minimum pseudo-weight and minimum pseudo-codewords of LDPC codes, IEEE Transactions on Information Theory, vol.53,   no.1, pp.480-485, 2008.

[22] Jiang Yong, Xia Shu-Tao, and Fu Fang-Wei, Stopping set distributions of some   Reed-Muller codes, IEEE Transactions on Information Theory, vol.57, no.9,   pp.6078-6088, 2011.

[23] Fu Fang-Wei, 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.265-283, July 2001.

[24] Fu Fang-Wei and V.K. Wei, Self-complementary balanced codes and   quasi-symmetric designs, Designs, Codes and Cryptography, vol.27, no.3, pp.271-279, 2002.

[25] Fu Fang-Wei, T. Klove, Luo Yuan, and V.K. Wei, On equidistant constant weight   codes, Discrete Applied Mathematics, vol.128, no.1, pp.157-164, 2003.

[26] Chen Lusheng, Fu Fang-Wei and V.K. Wei, On the constructions and nonlinearity   of binary vector-output correlation-immune functions, Journal of Complexity,   vol.20, no.2-3, pp.266-283, 2004.

[27] Fu Fang-Wei, 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 Shu-Tao and Fu Fang-Wei, On the minimum pseudo-codewords of LDPC codes,   IEEE Communication Letters, vol.10, no.5, pp. 363—365, 2006.

[29] Xia Shu-Tao and Fu Fang-Wei, On the stopping distance of finite geometry LDPC   codes, IEEE Communication Letters, vol.10, no.5, pp. 381—383, 2006.

[30] Fu Fang-Wei and Xia Shu-Tao, The characterization of binary constant weight   codes meeting the bound of Fu and Shen, Designs, Codes and Cryptography,   vol.43, no.1, pp. 9-20, 2007.

[31] Fu Fang-Wei and H. Niederreiter, On the counting function of the lattice   profile of periodic sequences, Journal of Complexity, vol.23, no.4-6, pp. 423-435, 2007.

[32] Xia Shu-Tao and Fu Fang-Wei, Undetected error probability of q-ary constant   weight codes, Designs, Codes and Cryptography, vol.48, no.2, pp. 125-140,   2008.

[33] Xia Shu-Tao, Fu Fang-Wei, and Y. Jiang, On the minimum average distance of   binary constant weight codes, Discrete Mathematics, vol.308, no.17, pp.3847-3859, 2008.

[34] Xia Shu-Tao and Fu Fang-Wei, Johnson type bounds on constant dimension codes,   Designs, Codes and Cryptography, vol.50, no.2, pp. 163-172, 2009.

[35] Fu Fang-Wei, H. Niederreiter, and F. Ozbudak, Joint linear complexity of multisequences   consisting of linear recurring sequences, Cryptography and Communications,   vol.1, no.1, pp. 3-29, 2009.

[36] Fu Fang-Wei, 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.475-496, 2009.

[37] Gao Zhi-Han and Fu Fang-Wei, The minimal polynomial over F_{q} of linear   recurring sequence over F_{q^{m}}, Finite Fields and Their Applications,   vol.15, no.6, pp.774-784, 2009.

[38] Gao Zhi-Han and Fu Fang-Wei, The minimal polynomial of sequence obtained from componentwise linear transformation of linear recurring sequence, Theoretical Computer Science, vol.411, no.44-46, pp.3883-3893, 2010.

[39] Guang Xuan, and Fu Fang-Wei, The average failure probabilities of random   linear network coding, IEICE Transactions on Fundamentals of Electronics,   Communications and Computer Sciences, vol.E94-A, no.10, pp.1991-2001, 2011.

[40] Guang Xuan, Fu Fang-Wei, and Zhen Zhang, Construction of network error   correction codes in packet networks, IEEE Transactions on Information Theory,   Accepted for Publication.

 

 

Awards

1. Program for Excellent Young Teachers in University, Ministry of Education,   1992.

2. Program for Trans-Century Excellent Talents in University, Ministry of Education, 2000.

3. Special Stipend by State Council, 2000.

Contact

Office: Room 309, Shiing-Shen Building

Tel: (86) 022-23509343,  Email: fwfu@nankai.edu.cn

 

 

Chern Institute of Mathematics, Nankai University, Tianjin 300071 China
Tel: 86-22-2350-1029, 86-22-2350-8228, Fax: 86-22-2350-8114, Email: cim@nankai.edu.cn
Copyright Chern Institute of Mathematics