Fang-Wei Fu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Fang-Wei Fu has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Shu-Tao Xia
Tsinghua Shenzhen International Graduate School, Tsinghua University, Shenzhen, China
4 shared publications - Chaoping Xing
National University of Singapore
2 shared publications - San Ling
Nanyang Technological University
2 shared publications - Yuan Luo
Institut für Experimentelle Mathematik, Universität Gesamthochschule Essen, Ellernstraße 29, 45326 Essen, Germany
2 shared publications Berthold-Georg Englert
1 shared publication- Harald Niederreiter
Natl Univ Singapore, Dept Math, Singapore 117543, Singapore
1 shared publication
Latest Publications
- Open Access
Minimum Pseudo-Weight and Minimum Pseudo-Codewords of LDPC Codes
In this correspondence, we study the minimum pseudo-weight and minimum pseudo-codewords of low-density parity-check (LDPC) codes under linear programming (LP) decoding. First, we show that the lower bound of Kelly, Sridhara, Xu and Rosenthal on the pseudo-weight of a pseudo-codeword of an LDPC code with girth greater than 4 is tight if and only if this pseudo-codeword is a real multiple of a codeword. Then, we show that the lower bound of Kashyap and Vardy on the stopping distance of an LDPC code is also a lower bound on the pseudo-weight of a pseudo-codeword of this LDPC code with girth 4, and this lower bound is tight if and only if this pseudo-codeword is a real multiple of a codeword. Using these results we further show that for some LDPC codes, there are no other minimum pseudo-codewords except the real multiples of minimum codewords. This means that the LP decoding for these LDPC codes is asymptotically optimal in the sense that the ratio of the probabilities of decoding errors of LP decoding and maximum-likelihood decoding approaches to 1 as the signal-to-noise ratio leads to infinity. Finally, some LDPC codes are listed to illustrate these results.
Open AccessMinimum Pseudo-Weight and Minimum Pseudo-Codewords of LDPC Codes
In this correspondence, we study the minimum pseudo-weight and minimum pseudo-codewords of low-density parity-check (LDPC) codes under linear programming (LP) decoding. First, we show that the lower bound of Kelly, Sridhara, Xu and Rosenthal on the pseudo-weight of a pseudo-codeword of an LDPC code with girth greater than 4 is tight if and only if this pseudo-codeword is a real multiple of a codeword. Then, we show that the lower bound of Kashyap and Vardy on the stopping distance of an LDPC code is also a lower bound on the pseudo-weight of a pseudo-codeword of this LDPC code with girth 4, and this lower bound is tight if and only if this pseudo-codeword is a real multiple of a codeword. Using these results we further show that for some LDPC codes, there are no other minimum pseudo-codewords except the real multiples of minimum codewords. This means that the LP decoding for these LDPC codes is asymptotically optimal in the sense that the ratio of the probabilities of decoding errors of LP decoding and maximum-likelihood decoding approaches to 1 as the signal-to-noise ratio leads to infinity. Finally, some LDPC codes are listed to illustrate these results.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 47-51
Stopping Set Distributions of Some Linear Codes
In this paper, the stopping set distributions (SSD) of some well-known binary linear codes are determined by using finite geometry theory. Similar to the weight distribution of a binary linear code, the SSD {Ti(H)}n i=0 enumerates the number of stopping sets with size i of a linear code with parity-check matrix H. First, we deal with the simplex codes and Hamming codes. With parity-check matrix formed by all the weight 3 codewords of the Hamming code, the SSD of the simplex code is completely determined with explicit formula. With parity-check matrix formed by all the nonzero codewords of the simplex code, the SSD of the Hamming code is completely determined with two recursive equations. Then, the first order Reed-Muller codes and the extended Hamming codes are discussed. With parity-check matrix formed by all the weight 4 codewords of the extended Hamming code, the SSD of the first order Reed-Muller code is completely determined with explicit formula. With parity-check matrix formed by all the minimum codewords of the first order Reed-Muller code, the SSD of the extended Hamming code is completely determined with two recursive equations
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 47-51
Stopping Set Distributions of Some Linear Codes
In this paper, the stopping set distributions (SSD) of some well-known binary linear codes are determined by using finite geometry theory. Similar to the weight distribution of a binary linear code, the SSD {Ti(H)}n i=0 enumerates the number of stopping sets with size i of a linear code with parity-check matrix H. First, we deal with the simplex codes and Hamming codes. With parity-check matrix formed by all the weight 3 codewords of the Hamming code, the SSD of the simplex code is completely determined with explicit formula. With parity-check matrix formed by all the nonzero codewords of the simplex code, the SSD of the Hamming code is completely determined with two recursive equations. Then, the first order Reed-Muller codes and the extended Hamming codes are discussed. With parity-check matrix formed by all the weight 4 codewords of the extended Hamming code, the SSD of the first order Reed-Muller code is completely determined with explicit formula. With parity-check matrix formed by all the minimum codewords of the first order Reed-Muller code, the SSD of the extended Hamming code is completely determined with two recursive equations
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 109-113
Minimum Pseudo-Codewords of LDPC Codes
In this paper, we study the minimum pseudo-weight and minimum pseudo-codewords of low-density parity-check (LDPC) codes under linear programming (LP) decoding. First, we show that the lower bound of Kelly, Sridhara, Xu and Rosenthal on the pseudo-weight of a pseudo-codeword of an LDPC code with girth greater than 4 is tight if and only if this pseudo-codeword is a real multiple of a codeword. Then, we show that the lower bound of Kashyap and Vardy on the stopping distance of an LDPC code is also a lower bound on the pseudo-weight of a pseudo-codeword of this LDPC code with girth 4, and this lower bound is tight if and only if this pseudo-codeword is a real multiple of a codeword. Using these results we further show that for some LDPC codes, there are no other minimum pseudo-codewords except the real multiples of minimum codewords. This means that LP decoding for these LDPC codes is asymptotically optimal in the sense that the ratio of the probabilities of decoding errors of LP decoding and maximum-likelihood (ML) decoding approaches to 1 as the signal-to-noise ratio leads to infinity. Finally, some LDPC codes are listed to illustrate these results
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 109-113
Minimum Pseudo-Codewords of LDPC Codes
In this paper, we study the minimum pseudo-weight and minimum pseudo-codewords of low-density parity-check (LDPC) codes under linear programming (LP) decoding. First, we show that the lower bound of Kelly, Sridhara, Xu and Rosenthal on the pseudo-weight of a pseudo-codeword of an LDPC code with girth greater than 4 is tight if and only if this pseudo-codeword is a real multiple of a codeword. Then, we show that the lower bound of Kashyap and Vardy on the stopping distance of an LDPC code is also a lower bound on the pseudo-weight of a pseudo-codeword of this LDPC code with girth 4, and this lower bound is tight if and only if this pseudo-codeword is a real multiple of a codeword. Using these results we further show that for some LDPC codes, there are no other minimum pseudo-codewords except the real multiples of minimum codewords. This means that LP decoding for these LDPC codes is asymptotically optimal in the sense that the ratio of the probabilities of decoding errors of LP decoding and maximum-likelihood (ML) decoding approaches to 1 as the signal-to-noise ratio leads to infinity. Finally, some LDPC codes are listed to illustrate these results
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 302-306
A Lower Bound on the Probability of Undetected Error for Binary Constant Weight Codes
In this paper, we study the probability of undetected error for binary constant weight codes (BCWCs). First, we derive a new lower bound on the probability of undetected error. Next, we show that this bound is tight if and only if the BCWCs are generated from certain t-designs. This means that such BCWCs are uniformly optimal for error detection. Thus, we prove a conjecture of Xia, Fu, Jiang and Ling. Furthermore, we determine the distance distributions of such BCWCs. Finally, we derive some bounds on the exponent of the probability of undetected error for BCWCs. These bounds enable us to extend the region in which the exponent of the probability of undetected error is exactly determined
- 1 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 302-306
A Lower Bound on the Probability of Undetected Error for Binary Constant Weight Codes
In this paper, we study the probability of undetected error for binary constant weight codes (BCWCs). First, we derive a new lower bound on the probability of undetected error. Next, we show that this bound is tight if and only if the BCWCs are generated from certain t-designs. This means that such BCWCs are uniformly optimal for error detection. Thus, we prove a conjecture of Xia, Fu, Jiang and Ling. Furthermore, we determine the distance distributions of such BCWCs. Finally, we derive some bounds on the exponent of the probability of undetected error for BCWCs. These bounds enable us to extend the region in which the exponent of the probability of undetected error is exactly determined
- Open Access
Codes for Key Generation in Quantum Cryptography
As an alternative to the usual key generation by two-way communication in schemes for quantum cryptography, we consider codes for key generation by one-way communication. We study codes that could be applied to the raw key sequences that are ideally obtained in recently proposed scenarios for quantum key distribution, which can be regarded as communication through symmetric four-letter channels.
Open AccessCodes for Key Generation in Quantum Cryptography
As an alternative to the usual key generation by two-way communication in schemes for quantum cryptography, we consider codes for key generation by one-way communication. We study codes that could be applied to the raw key sequences that are ideally obtained in recently proposed scenarios for quantum key distribution, which can be regarded as communication through symmetric four-letter channels.
- 1 January 2004
- Published by Springer Nature
- p. 139-152
Constructions of Nonbinary Codes Correcting t-Symmetric Errors and Detecting All Unidirectional Errors: Magnitude Error Criterion
- 1 January 2004
- Published by Springer Nature
- p. 139-152
Constructions of Nonbinary Codes Correcting t-Symmetric Errors and Detecting All Unidirectional Errors: Magnitude Error Criterion
- 8 February 2003
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 128 (1) , 157-164
On equidistant constant weight codes
- 8 February 2003
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 128 (1) , 157-164
On equidistant constant weight codes
- 6 January 2003
- Published by Elsevier in Discrete Mathematics
- Vol. 260 (1-3) , 101-117
A new kind of geometric structures determining the chain good weight hierarchies
- 6 January 2003
- Published by Elsevier in Discrete Mathematics
- Vol. 260 (1-3) , 101-117
A new kind of geometric structures determining the chain good weight hierarchies