Let \({\mathbb {F}}_q\) denote the finite field of order q, and let \(n = m_1+m_2+\cdots +m_\ell ,\) where \(m_1,m_2,\ldots ,m_\ell \) are arbitrary positive integers (not necessarily coprime to q). In this paper, we explicitly determine Hamming weights of all non-zero codewords of several classes of multi-twisted codes of length n and block lengths \((m_1,m_2,\ldots ,m_\ell )\) over \({\mathbb {F}}_q.\) As an application of these results, we explicitly determine Hamming weight distributions of several classes of multi-twisted codes of length n and block lengths \((m_1,m_2,\ldots , m_{\ell })\) over \({\mathbb {F}}_q.\) Among these classes of multi-twisted codes, we 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 illustrate our results with some examples, and list many optimal, projective and minimal linear codes belonging to these classes of multi-twisted codes.

设\（{\ mathbb {F}} _ q \）表示阶q的有限域，并设\（n = m_1 + m_2 + \ cdots + m_ \ ell，\）其中\（m_1，m_2，\ ldots，m_ \ ell \）是任意正整数（不一定与q互质）。在本文中，我们明确地确定了几类的长度的复捻码的所有非零码字的汉明权Ñ和块长度\（（M_1，M_2，\ ldots，M_ \ ELL）\）超过\（{\ mathbb {F}} _ q。\）作为这些结果的应用，我们明确确定长度为n和块长度的几类多捻代码的汉明权重分布\（（M_1，M_2，\ ldots，米_ {\ ELL}）\）超过\（{\ mathbb {F}} _ Q值。\）在这些类中的复捻码，我们确定两类线性码优化等距离的与组合设计理论以及其他几类最小线性代码有很好的联系，这些代码对于构建具有良好访问结构的秘密共享方案很有用。我们通过一些示例来说明我们的结果，并列出属于这些多扭曲代码类别的许多最佳，投影和最小线性代码。