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.展开更多
Recently,linear codes with a few weights have been extensively studied due to their applications in secret sharing schemes,constant composition codes,strongly regular graphs and so on.In this paper,based on the Weil s...Recently,linear codes with a few weights have been extensively studied due to their applications in secret sharing schemes,constant composition codes,strongly regular graphs and so on.In this paper,based on the Weil sums,several classes of two-weight or three-weight linear codes are presented by choosing a proper defining set,and their weight enumerators and complete weight enumerators are determined.Furthermore,these codes are proven to be minimal.By puncturing these linear codes,two classes of two-weight projective codes are obtained,and the parameters of the corresponding strongly regular graph are given.This paper generalizes the results of[7].展开更多
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.展开更多
Recently, linear codes over finite fields with a few weights have been extensively studied due to their applications in secret sharing schemes, authentication codes, constant composition codes. In this paper, for an o...Recently, linear codes over finite fields with a few weights have been extensively studied due to their applications in secret sharing schemes, authentication codes, constant composition codes. In this paper, for an odd prime p,the complete weight enumerator of a class of p-ary linear codes based on defining sets are determined. Furthermore, from the explicit complete weight enumerator of linear codes, a new class of optimal constant composition codes and several classes of asymptotically optimal systematic authentication codes are obtained.展开更多
给出环n s(k)M上线性码的精确完全重量计数器的定义及相应的MacWilliams恒等式,并对环M n s(k)上线性码的精确完全重量计数器、k上线性码的精确重量计数器以及k上线性码的完全重量计数器之间的联系进行研究,结果表明,环M n s(k)上线性...给出环n s(k)M上线性码的精确完全重量计数器的定义及相应的MacWilliams恒等式,并对环M n s(k)上线性码的精确完全重量计数器、k上线性码的精确重量计数器以及k上线性码的完全重量计数器之间的联系进行研究,结果表明,环M n s(k)上线性码的精确完全重量计数器相比其他2种重量计数器更具一般性,可更好地用于码的结构研究和译码错误概率计算。展开更多
文摘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.
基金supported by the Natural Science Foundation of China (No.11901062)the Sichuan Natural Science Foundation (No.2024NSFSC0417)。
文摘Recently,linear codes with a few weights have been extensively studied due to their applications in secret sharing schemes,constant composition codes,strongly regular graphs and so on.In this paper,based on the Weil sums,several classes of two-weight or three-weight linear codes are presented by choosing a proper defining set,and their weight enumerators and complete weight enumerators are determined.Furthermore,these codes are proven to be minimal.By puncturing these linear codes,two classes of two-weight projective codes are obtained,and the parameters of the corresponding strongly regular graph are given.This paper generalizes the results of[7].
文摘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.
基金supported by the National Natural Science Foundation of China under Grant No.11401408Project of Science and Technology Department of Sichuan Province under Grant No.2016JY0134the National Key R and Program of China under Grant No.2016QY04W080
文摘Recently, linear codes over finite fields with a few weights have been extensively studied due to their applications in secret sharing schemes, authentication codes, constant composition codes. In this paper, for an odd prime p,the complete weight enumerator of a class of p-ary linear codes based on defining sets are determined. Furthermore, from the explicit complete weight enumerator of linear codes, a new class of optimal constant composition codes and several classes of asymptotically optimal systematic authentication codes are obtained.
文摘给出环n s(k)M上线性码的精确完全重量计数器的定义及相应的MacWilliams恒等式,并对环M n s(k)上线性码的精确完全重量计数器、k上线性码的精确重量计数器以及k上线性码的完全重量计数器之间的联系进行研究,结果表明,环M n s(k)上线性码的精确完全重量计数器相比其他2种重量计数器更具一般性,可更好地用于码的结构研究和译码错误概率计算。
