<p>Constacyclic BCH codes, as a generalization of BCH codes, have been widely used in the construction of quantum codes. In this paper, we mainly study narrow-sense Hermitian dual-containing constacyclic BCH codes over <InlineEquation ID="IEq1"> <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> of new length <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(n=\frac{q^{2m}-1}{a(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> <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>, where <i>q</i> is a prime power, <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(m \ge 3\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>m</mi> <mo>≥</mo> <mn>3</mn> </mrow> </math></EquationSource> </InlineEquation> is an odd integer and <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(a \ne 1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>a</mi> <mo>≠</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation> is a divisor of <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(q-1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>q</mi> <mo>-</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation>, as well as of length <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(n=\frac{2(q^m+1)}{q+1}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>=</mo> <mfrac> <mrow> <mn>2</mn> <mo stretchy="false">(</mo> <msup> <mi>q</mi> <mi>m</mi> </msup> <mo>+</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> <mrow> <mi>q</mi> <mo>+</mo> <mn>1</mn> </mrow> </mfrac> </mrow> </math></EquationSource> </InlineEquation>, where <i>q</i> is an odd prime power and <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(m \ge 3\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>m</mi> <mo>≥</mo> <mn>3</mn> </mrow> </math></EquationSource> </InlineEquation> is odd. Firstly, we present some necessary and sufficient conditions for these constacyclic BCH codes to be Hermitian dual-containing. Secondly, the explicit dimensions of these constacyclic BCH codes are completely determined. Furthermore, some quantum codes with new parameters are constructed by these Hermitian dual-containing constacyclic BCH codes.</p>

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

Hermitian dual-containing constacyclic BCH codes of new length and related quantum codes

  • Xueting Wang,
  • Junling Zhou

摘要

Constacyclic BCH codes, as a generalization of BCH codes, have been widely used in the construction of quantum codes. In this paper, we mainly study narrow-sense Hermitian dual-containing constacyclic BCH codes over \(\mathbb {F}_{q^2}\) F q 2 of new length \(n=\frac{q^{2m}-1}{a(q+1)}\) n = q 2 m - 1 a ( q + 1 ) , where q is a prime power, \(m \ge 3\) m 3 is an odd integer and \(a \ne 1\) a 1 is a divisor of \(q-1\) q - 1 , as well as of length \(n=\frac{2(q^m+1)}{q+1}\) n = 2 ( q m + 1 ) q + 1 , where q is an odd prime power and \(m \ge 3\) m 3 is odd. Firstly, we present some necessary and sufficient conditions for these constacyclic BCH codes to be Hermitian dual-containing. Secondly, the explicit dimensions of these constacyclic BCH codes are completely determined. Furthermore, some quantum codes with new parameters are constructed by these Hermitian dual-containing constacyclic BCH codes.