The definition of good codes for error-detection is given. It is proved that a (n, k) linear block code in GF(q) are the good code for error-detection, if and only if its dual code is also. A series of new results abo...The definition of good codes for error-detection is given. It is proved that a (n, k) linear block code in GF(q) are the good code for error-detection, if and only if its dual code is also. A series of new results about the good codes for error-detection are derived. New lower bounds for undetected error probabilities are obtained, which are relative to n and k only, and not the weight structure of the codes.展开更多
In the present communication, we have obtained the optimum probability distribution with which the messages should be delivered so that the average redundancy of the source is minimized. Here, we have taken the case o...In the present communication, we have obtained the optimum probability distribution with which the messages should be delivered so that the average redundancy of the source is minimized. Here, we have taken the case of various generalized mean codeword lengths. Moreover, the upper bound to these codeword lengths has been found for the case of Huffman encoding.展开更多
As one of the most important components of the wideband wireless access technique, orthogonal frequency division multiplexing （OFDM） has a high usage rate of spectrum and combats inter-symbol interference （ISI） in...As one of the most important components of the wideband wireless access technique, orthogonal frequency division multiplexing （OFDM） has a high usage rate of spectrum and combats inter-symbol interference （ISI） in multi-path fading channel. However, when there are frequency offsets during the signal transmission, the inter-carrier interference （ICI） is introduced, which significantly degrades the performance. The existing ICI self-cancellation schemes such as PCC-OFDM are not optimum to minimize the interference considering both noise and ICI. In this paper, a new metric named S1NR （signal-to-interference- and-noise ratio） is proposed. We discuss the optimization issue when a constant frequency offset exists and in time-varying channels. The optimum weighting-coefficient-pair （OWCP） is obtained, which maximizes SINR theoretically through the alternant iteration algorithm. Simulations show that the performance of OWCP-OFDM is better than that of PCC-OFDM, especially when the frequency offset is large. Although the ICI self-cancellation scheme suffers bandwidth inefficiency, from the simulation results we can also see that the performance of OWCP-OFDM is much better than that of the standard OFDM systems with the same bandwidth efficiency when a frequency offset exists. Moreover, since the redundant modulation provides the capability to suppress ICI as well as a receiving SNR gain, it can be considered as exchanging the bandwidth for SNR.展开更多
The paper introduces the state reduction algorithm and accelerated state reduction algorithm are used to compute the distance weight enumerator(transfer function) T[x,y] of convolutional codes.Next use computer simula...The paper introduces the state reduction algorithm and accelerated state reduction algorithm are used to compute the distance weight enumerator(transfer function) T[x,y] of convolutional codes.Next use computer simulation to compare upper bound on the bit error probability on an additive white Gaussian noise (AWGN) for maximum free distance (MFD) codes of previously found and optimum distance spectrum (ODS) codes with rate 1/4,overall constraint length are 5 and 7,respectively. Finally,a method of how to search for good convolutional codes is given.展开更多
The paper introduces the state reduction algorithm and accelerated state reduction algorithm are used to compute the distance weight enumerator(transfer function)T[x,y] of convolutional codes.Next use computer simulat...The paper introduces the state reduction algorithm and accelerated state reduction algorithm are used to compute the distance weight enumerator(transfer function)T[x,y] of convolutional codes.Next use computer simulation to compare upper bound on the bit error probability on an additive white Gaussian noise(AWGN) for maximum free distance(MFD) codes of previously found and optimum distance spectrum(ODS) codes with rate 1/4,overall constraint length are 5 and 7,respectively.Finally,a method of how to search for good convolutional codes is given.展开更多
CONSTANT weight codes are very important in coding theory for its application to communication. In refs. [1—5], the undetected error probabilities (UEP)of binary nonlinear constant weight codes (BNCW) were studied, a...CONSTANT weight codes are very important in coding theory for its application to communication. In refs. [1—5], the undetected error probabilities (UEP)of binary nonlinear constant weight codes (BNCW) were studied, and Wang et al. showed that when n】8, BNCW codes (n, 2, ω) were not proper, Wang proposed a conjecture that when n】4δ and δ】 1, BNCW codes (n, 2δ, ω) are not proper. in this note, the error-detecting abilities展开更多
文摘The definition of good codes for error-detection is given. It is proved that a (n, k) linear block code in GF(q) are the good code for error-detection, if and only if its dual code is also. A series of new results about the good codes for error-detection are derived. New lower bounds for undetected error probabilities are obtained, which are relative to n and k only, and not the weight structure of the codes.
文摘In the present communication, we have obtained the optimum probability distribution with which the messages should be delivered so that the average redundancy of the source is minimized. Here, we have taken the case of various generalized mean codeword lengths. Moreover, the upper bound to these codeword lengths has been found for the case of Huffman encoding.
基金Project (No. 2006AA01Z273) supported by the Hi-Tech ResearchDevelopment Program (863) of China
文摘As one of the most important components of the wideband wireless access technique, orthogonal frequency division multiplexing （OFDM） has a high usage rate of spectrum and combats inter-symbol interference （ISI） in multi-path fading channel. However, when there are frequency offsets during the signal transmission, the inter-carrier interference （ICI） is introduced, which significantly degrades the performance. The existing ICI self-cancellation schemes such as PCC-OFDM are not optimum to minimize the interference considering both noise and ICI. In this paper, a new metric named S1NR （signal-to-interference- and-noise ratio） is proposed. We discuss the optimization issue when a constant frequency offset exists and in time-varying channels. The optimum weighting-coefficient-pair （OWCP） is obtained, which maximizes SINR theoretically through the alternant iteration algorithm. Simulations show that the performance of OWCP-OFDM is better than that of PCC-OFDM, especially when the frequency offset is large. Although the ICI self-cancellation scheme suffers bandwidth inefficiency, from the simulation results we can also see that the performance of OWCP-OFDM is much better than that of the standard OFDM systems with the same bandwidth efficiency when a frequency offset exists. Moreover, since the redundant modulation provides the capability to suppress ICI as well as a receiving SNR gain, it can be considered as exchanging the bandwidth for SNR.
文摘The paper introduces the state reduction algorithm and accelerated state reduction algorithm are used to compute the distance weight enumerator(transfer function) T[x,y] of convolutional codes.Next use computer simulation to compare upper bound on the bit error probability on an additive white Gaussian noise (AWGN) for maximum free distance (MFD) codes of previously found and optimum distance spectrum (ODS) codes with rate 1/4,overall constraint length are 5 and 7,respectively. Finally,a method of how to search for good convolutional codes is given.
文摘The paper introduces the state reduction algorithm and accelerated state reduction algorithm are used to compute the distance weight enumerator(transfer function)T[x,y] of convolutional codes.Next use computer simulation to compare upper bound on the bit error probability on an additive white Gaussian noise(AWGN) for maximum free distance(MFD) codes of previously found and optimum distance spectrum(ODS) codes with rate 1/4,overall constraint length are 5 and 7,respectively.Finally,a method of how to search for good convolutional codes is given.
文摘CONSTANT weight codes are very important in coding theory for its application to communication. In refs. [1—5], the undetected error probabilities (UEP)of binary nonlinear constant weight codes (BNCW) were studied, and Wang et al. showed that when n】8, BNCW codes (n, 2, ω) were not proper, Wang proposed a conjecture that when n】4δ and δ】 1, BNCW codes (n, 2δ, ω) are not proper. in this note, the error-detecting abilities
