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.展开更多
基金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.
