New stabilizer codes from the construction of dual-containing matrix-product codes (Q2302591): Difference between revisions

A matrix-product code is a natural wait to construct large codes from small ones. This is of particular interest when then length is much larger than the field size, in such a case the singleton bound is not achieved if the MDS conjecture is true. More precisely, if one has linear codes \(C_1,\ldots,C_r\) over \(\mathbb{F}_q\) and a Matrix \(A\) of size \(r\times \ell\), also over the same field, then the matrix-product code is the set of all product \([c_1,\ldots,c_r] \cdot A\) where each \(c_i\in C_i\). On the other hand if a linear code \(C\) contains its dual, i.e., \(C^{\perp}\subset C\) the there exist a quantum stabilizer code. In [\textit{C. Galindo} et al., Finite Fields Appl. 36, 98--120 (2015; Zbl 1355.94093)] it was proposed to use \(C\) a matrix-product code where \(A\) is an orthogonal matrix and the constituent codes satisfies \(C_i^{\perp}\subset C_i\) for constructing stabilizer quantum codes. In the present work they extend such a construction to a wider family of matrix-product codes: First to a family where the matrix \(A\) is not necessary orthogonal, and second to a family where the condition \(C_i^{\perp}\subset C_i\) is not needed.