<p>Let <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40314_2025_3323_Article_IEq1.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="48" /> </InlineMediaObject> <EquationSource Format="TEX">\(q=p^{e}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>q</mi> <mo>=</mo> <msup> <mi>p</mi> <mi>e</mi> </msup> </mrow> </math></EquationSource> </InlineEquation> be a prime power and <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40314_2025_3323_Article_IEq2.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="12" /> </InlineMediaObject> <EquationSource Format="TEX">\(\ell \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>ℓ</mi> </math></EquationSource> </InlineEquation> be an integer with <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40314_2025_3323_Article_IEq3.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="72" /> </InlineMediaObject> <EquationSource Format="TEX">\(0 \le \ell &lt; e\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>0</mn> <mo>≤</mo> <mi>ℓ</mi> <mo>&lt;</mo> <mi>e</mi> </mrow> </math></EquationSource> </InlineEquation>. <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40314_2025_3323_Article_IEq2.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="12" /> </InlineMediaObject> <EquationSource Format="TEX">\(\ell \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>ℓ</mi> </math></EquationSource> </InlineEquation>-Galois self-orthogonal codes generalize both Euclidean self-orthogonal codes (<InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40314_2025_3323_Article_IEq5.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="39" /> </InlineMediaObject> <EquationSource Format="TEX">\(\ell =0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>ℓ</mi> <mo>=</mo> <mn>0</mn> </mrow> </math></EquationSource> </InlineEquation>) and Hermitian self-orthogonal codes (<InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40314_2025_3323_Article_IEq6.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="39" /> </InlineMediaObject> <EquationSource Format="TEX">\(\ell =\frac{e}{2}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>ℓ</mi> <mo>=</mo> <mfrac> <mi>e</mi> <mn>2</mn> </mfrac> </mrow> </math></EquationSource> </InlineEquation> and <i>e</i> is even). In this paper, we characterize two general methods for constructing <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40314_2025_3323_Article_IEq2.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="12" /> </InlineMediaObject> <EquationSource Format="TEX">\(\ell \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>ℓ</mi> </math></EquationSource> </InlineEquation>-Galois self-orthogonal matrix-product codes over <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40314_2025_3323_Article_IEq8.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="18" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathbb {F}_{q}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="double-struck">F</mi> <mi>q</mi> </msub> </math></EquationSource> </InlineEquation> from some non-singular matrices and special input codes, and determine the parameters of the obtained <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40314_2025_3323_Article_IEq2.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="12" /> </InlineMediaObject> <EquationSource Format="TEX">\(\ell \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>ℓ</mi> </math></EquationSource> </InlineEquation>-Galois self-orthogonal matrix-product codes when the underlying matrices and input codes satisfy some concrete conditions. Moreover, some special matrices used in the matrix-product constructions are also proposed. As an application, many quantum error-correcting codes (QECCs) with better parameters than the QECCs available in the literature are derived from the Hermitian self-orthogonal matrix-product codes.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Matrix-product constructions for Galois self-orthogonal codes and new quantum codes

  • Liqi Wang,
  • Xinxin Zhang,
  • Shixin Zhu

摘要

Let \(q=p^{e}\) q = p e be a prime power and \(\ell \) be an integer with \(0 \le \ell < e\) 0 < e . \(\ell \) -Galois self-orthogonal codes generalize both Euclidean self-orthogonal codes ( \(\ell =0\) = 0 ) and Hermitian self-orthogonal codes ( \(\ell =\frac{e}{2}\) = e 2 and e is even). In this paper, we characterize two general methods for constructing \(\ell \) -Galois self-orthogonal matrix-product codes over \(\mathbb {F}_{q}\) F q from some non-singular matrices and special input codes, and determine the parameters of the obtained \(\ell \) -Galois self-orthogonal matrix-product codes when the underlying matrices and input codes satisfy some concrete conditions. Moreover, some special matrices used in the matrix-product constructions are also proposed. As an application, many quantum error-correcting codes (QECCs) with better parameters than the QECCs available in the literature are derived from the Hermitian self-orthogonal matrix-product codes.