Complete Weight Enumerator for a Class of Linear Codes from Defining Sets and Their Applications
- 6 Downloads
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.
KeywordsAuthentication codes complete weight enumerator constant composition codes exponential sums linear codes secret sharing schemes weight distributions
Unable to display preview. Download preview PDF.
- Li F, Wang Q Y, and Lin D D, A class of three-weight and five-weight linear codes, Discret. Appl. Math., 2017, arXiv: 1509.06242v1.Google Scholar
- Lidl R, Niederreiter H, and Cohn F M, Finite Fields, Cambridge University Press, Cambridge 1997.Google Scholar