# Two classes of linear codes with a few weights based on twisted Kloosterman sums

## TL;DR

This paper constructs two new classes of linear codes with few weights using twisted Kloosterman sums and determines their parameters, advancing coding theory applications.

## Contribution

The paper introduces two novel classes of linear codes with few weights and explicitly determines their complete weight enumerators using twisted Kloosterman sums.

## Key findings

- Constructed two classes of linear codes with few weights
- Determined the complete weight enumerators of these codes
- Enhanced understanding of code parameters via twisted Kloosterman sums

## Abstract

Linear codes with a few weights have wide applications in information security, data storage systems, consuming electronics and communication systems. Construction of the linear codes with a few weights and determination of their parameters are an important research topic in coding theory. In this paper, we construct two classes of linear codes with a few weights and determine their complete weight enumerators based on twisted Kloosterman sums.