In this paper, we explicitly determine Hamming weight enumerators of several classes of multi-twisted codes over finite fields with at most two non-zero constituents, where each non-zero constituent has dimension 1. Among these classes of multi-twisted codes, we further identify two classes of optimal equidistant linear codes that have nice connections with the theory of combinatorial designs and several other classes of minimal linear codes that are useful in constructing secret sharing schemes with nice access structures. We also illustrate our results with some examples.

中文翻译：

---

最多具有两个非零成分的多扭码的汉明权枚举器

在本文中，我们在最多具有两个非零成分的有限域上明确确定了几类多扭码的汉明权枚举数，其中每个非零成分的维数为 1。在这些多扭码类别中，我们进一步确定两类最佳等距线性码，它们与组合设计理论有很好的联系，以及其他几类最小线性码，它们可用于构建具有良好访问结构的秘密共享方案。我们还用一些例子来说明我们的结果。