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.

翻译：具有少量重量的线性码在数据存储系统、秘密共享方案和认证码中具有应用价值。本文利用给定的定义集构造了几类p元线性码（p为素数），这些码具有少量重量。基于有限域上的Kloosterman和，确定了它们的重量分布。此外，给出的部分线性码是极小码。