Two classes of linear codes with a few weights based on twisted Kloosterman sums
This work provides new linear codes for applications in information security and communication, but it is incremental as it builds on existing methods with a specific mathematical twist.
The paper constructed two classes of linear codes with a few weights using twisted Kloosterman sums and determined their complete weight enumerators, addressing a key problem in coding theory for applications like information security and communication systems.
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.