We investigate a class of linear codes by choosing a proper defining set and determine their complete weight enumerators and weight enumerators. These codes have at most three weights and some of them are almost optimal so that they are suitable for applications in secret sharing schemes. This is a supplement of the results raised by Wang et al. (2017) and Kong et al. (2019).

中文翻译：

---

有限域上一类线性代码的完全权重枚举器

我们通过选择适当的定义集来研究一类线性代码，并确定其完整的权重枚举数和权重枚举数。这些代码最多具有三个权重，其中一些权重几乎是最优的，因此它们适用于秘密共享方案中的应用。这是Wang等人提出的结果的补充。（2017）和Kong等。（2019）。