<p>Let <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10773_2025_5895_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="42" /> </InlineMediaObject> <EquationSource Format="TEX">\(q\ge 3\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>q</mi> <mo>≥</mo> <mn>3</mn> </mrow> </math></EquationSource> </InlineEquation> be an odd prime power and <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10773_2025_5895_Article_IEq2.gif" Format="GIF" Height="15" Rendition="HTML" Resolution="72" Type="Linedraw" Width="47" /> </InlineMediaObject> <EquationSource Format="TEX">\(m\ge 2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>m</mi> <mo>≥</mo> <mn>2</mn> </mrow> </math></EquationSource> </InlineEquation> be an even integer. In this paper, a kind of narrow-sense constacyclic BCH codes over <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10773_2025_5895_Article_IEq3.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="22" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathbb {F}_{q^2}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="double-struck">F</mi> <msup> <mi>q</mi> <mn>2</mn> </msup> </msub> </math></EquationSource> </InlineEquation> with lengths <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10773_2025_5895_Article_IEq4.gif" Format="GIF" Height="29" Rendition="HTML" Resolution="72" Type="Linedraw" Width="77" /> </InlineMediaObject> <EquationSource Format="TEX">\(n=\frac{q^{2m}-1}{2a(q+1)}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>=</mo> <mfrac> <mrow> <msup> <mi>q</mi> <mrow> <mn>2</mn> <mi>m</mi> </mrow> </msup> <mo>-</mo> <mn>1</mn> </mrow> <mrow> <mn>2</mn> <mi>a</mi> <mo stretchy="false">(</mo> <mi>q</mi> <mo>+</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> </mfrac> </mrow> </math></EquationSource> </InlineEquation> are studied, where <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10773_2025_5895_Article_IEq5.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="143" /> </InlineMediaObject> <EquationSource Format="TEX">\(q\equiv a+1 \pmod {2a}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>q</mi> <mo>≡</mo> <mi>a</mi> <mo>+</mo> <mn>1</mn> <mspace width="4.44443pt" /> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mn>2</mn> <mi>a</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10773_2025_5895_Article_IEq6.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="70" /> </InlineMediaObject> <EquationSource Format="TEX">\(a&lt;q-1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>a</mi> <mo>&lt;</mo> <mi>q</mi> <mo>-</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation>. The maximum designed distances such that narrow-sense constacyclic BCH codes over <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10773_2025_5895_Article_IEq7.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="22" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathbb {F}_{q^2}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="double-struck">F</mi> <msup> <mi>q</mi> <mn>2</mn> </msup> </msub> </math></EquationSource> </InlineEquation> with length <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10773_2025_5895_Article_IEq8.gif" Format="GIF" Height="29" Rendition="HTML" Resolution="72" Type="Linedraw" Width="44" /> </InlineMediaObject> <EquationSource Format="TEX">\(\frac{q^{2m}-1}{2a(q+1)}\)</EquationSource> <EquationSource Format="MATHML"><math> <mfrac> <mrow> <msup> <mi>q</mi> <mrow> <mn>2</mn> <mi>m</mi> </mrow> </msup> <mo>-</mo> <mn>1</mn> </mrow> <mrow> <mn>2</mn> <mi>a</mi> <mo stretchy="false">(</mo> <mi>q</mi> <mo>+</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> </mfrac> </math></EquationSource> </InlineEquation> containing their Hermitian dual codes are determined. We obtain some quantum codes with good parameters by such narrow-sense constacyclic BCH codes. The quantum codes that we construct have larger designed distances or dimensions than the ones with the same length in the literature.</p>

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

Some New Quantum Codes from Constacyclic BCH Codes

  • Ping Li,
  • Yancong Wei,
  • Xiaoshan Kai,
  • Jin Li

摘要

Let \(q\ge 3\) q 3 be an odd prime power and \(m\ge 2\) m 2 be an even integer. In this paper, a kind of narrow-sense constacyclic BCH codes over \(\mathbb {F}_{q^2}\) F q 2 with lengths \(n=\frac{q^{2m}-1}{2a(q+1)}\) n = q 2 m - 1 2 a ( q + 1 ) are studied, where \(q\equiv a+1 \pmod {2a}\) q a + 1 ( mod 2 a ) and \(a<q-1\) a < q - 1 . The maximum designed distances such that narrow-sense constacyclic BCH codes over \(\mathbb {F}_{q^2}\) F q 2 with length \(\frac{q^{2m}-1}{2a(q+1)}\) q 2 m - 1 2 a ( q + 1 ) containing their Hermitian dual codes are determined. We obtain some quantum codes with good parameters by such narrow-sense constacyclic BCH codes. The quantum codes that we construct have larger designed distances or dimensions than the ones with the same length in the literature.