It is known from the CSS code construction that an ${[[m,2k-m,\ge d]]}_q$ stabilizer code can be obtained from a (Euclidean) dual-containing ${[m,k,d]}_q$ code. In [5], Blackmore and Norton introduced an interesting code called matrix-product code, which is very useful in constructing new quantum codes of large lengths. Recently, Galindo et al. [16] constructed several classes of stabilizer codes from the dual-containing matrix-product codes of (generalized) Reed-Muller, hyperbolic and affine variety ones. In this paper, we first provide a more general approach to construct dual-containing matrix-product codes and then further study it in two cases. The first case generalizes the result by Galindo et al. and constructs dual-containing matrix-product codes more explicitly since the matrices involved are not restricted to be orthogonal. The second case presents a different way to construct dual-containing matrix-product codes in which some of the constituent codes are not required to be dual-containing. Through the construction of dual-containing matrix-product codes of Reed-Muller and affine variety ones, the CSS code construction and Steane's enlargement, we supply several classes of new stabilizer codes over the fields ${\mathbb{F}}_5$, ${\mathbb{F}}_7$ and ${\mathbb{F}}_9$ either having minimum distances larger than the ones achieved from the first case or the technique in [16], or having lengths that are not studied in [16].

从CSS代码构造可以知道 ${[[米，2ķ-米，\ge d]]}_q$ 稳定剂代码可以从（欧几里得）对偶 ${[米，ķ，d]}_q$码。在[5]中，Blackmore和Norton引入了一种有趣的代码，称为矩阵乘积代码，在构造新的大长度量子代码时非常有用。最近，Galindo等人。[16]从（广义）Reed-Muller，双曲和仿射变数的双重包含矩阵乘积代码构造了几类稳定器代码。在本文中，我们首先提供一种更通用的方法来构造包含双重值的矩阵乘积代码，然后在两种情况下对其进行进一步研究。第一种情况概括了Galindo等人的结果。由于涉及的矩阵不限于正交，因此更明确地构造了包含对偶的矩阵乘积码。第二种情况提出了一种构造包含双重的矩阵乘积码的不同方法，其中某些组成代码不需要包含双重。通过构造Reed-Muller和仿射变种的双重包含的矩阵乘积代码，CSS代码构造和Steane的扩大，我们在各个领域提供了几类新的稳定器代码${\mathbb{F}}_5$， ${\mathbb{F}}_7$ 和 ${\mathbb{F}}_9$ 其最小距离大于第一种情况或[16]中的技术所实现的最小距离，或者具有[16]中未研究的长度。