The weight distributions of some linear codes derived from Kloosterman sums
Mengzhen Zhao, Yanxun Chang · arXiv (Cornell University) · 2024
Linear codes with few weights have applications in data storage systems, secret sharing schemes, and authentication codes. In this paper, some kinds of p-ary linear codes with few weights are constructed by use of the given de ning set, where p is a prime. Their weight distributions are determined based on Kloosterman sums over nite elds. In addition, some linear codes we given is minimal.