<p>Let <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11128_2025_4666_Article_IEq1.gif" Format="GIF" Height="21" Rendition="HTML" Resolution="72" Type="Linedraw" Width="164" /> </InlineMediaObject> <EquationSource Format="TEX">\(R_{q,v}={\mathbb {F}}_q+v{\mathbb {F}}_q+ v^2{\mathbb {F}}_q\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>R</mi> <mrow> <mi>q</mi> <mo>,</mo> <mi>v</mi> </mrow> </msub> <mo>=</mo> <msub> <mi mathvariant="double-struck">F</mi> <mi>q</mi> </msub> <mo>+</mo> <mi>v</mi> <msub> <mi mathvariant="double-struck">F</mi> <mi>q</mi> </msub> <mo>+</mo> <msup> <mi>v</mi> <mn>2</mn> </msup> <msub> <mi mathvariant="double-struck">F</mi> <mi>q</mi> </msub> </mrow> </math></EquationSource> </InlineEquation> where <i>q</i> is an odd prime power and <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11128_2025_4666_Article_IEq2.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="49" /> </InlineMediaObject> <EquationSource Format="TEX">\(v^3=v\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mi>v</mi> <mn>3</mn> </msup> <mo>=</mo> <mi>v</mi> </mrow> </math></EquationSource> </InlineEquation>. In this paper, we first provide structures of the Euclidean sums and hulls of cyclic codes of length <i>n</i> over <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11128_2025_4666_Article_IEq3.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="30" /> </InlineMediaObject> <EquationSource Format="TEX">\(R_{q,v}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>R</mi> <mrow> <mi>q</mi> <mo>,</mo> <mi>v</mi> </mrow> </msub> </math></EquationSource> </InlineEquation>. Then, we exhibit a method of constructing new quantum error-correcting (abbreviated to QEC) codes via the Euclidean sums of cyclic codes over <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11128_2025_4666_Article_IEq4.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="30" /> </InlineMediaObject> <EquationSource Format="TEX">\(R_{q,v}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>R</mi> <mrow> <mi>q</mi> <mo>,</mo> <mi>v</mi> </mrow> </msub> </math></EquationSource> </InlineEquation> and CSS constructions. Finally, we construct two new classes of entanglement-assisted quantum error-correcting (abbreviated to EAQEC) codes by means of the Euclidean hulls of cyclic codes of length <i>n</i> over <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11128_2025_4666_Article_IEq5.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="30" /> </InlineMediaObject> <EquationSource Format="TEX">\(R_{q,v}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>R</mi> <mrow> <mi>q</mi> <mo>,</mo> <mi>v</mi> </mrow> </msub> </math></EquationSource> </InlineEquation>. In addition, to enrich the variety of available QEC and EAQEC codes, many new QEC and EAQEC codes are constructed to illustrate our results.</p>

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

Cyclic codes over a semi-local ring and their applications to QEC and EAQEC codes

  • Hui Li,
  • Xiusheng Liu

摘要

Let \(R_{q,v}={\mathbb {F}}_q+v{\mathbb {F}}_q+ v^2{\mathbb {F}}_q\) R q , v = F q + v F q + v 2 F q where q is an odd prime power and \(v^3=v\) v 3 = v . In this paper, we first provide structures of the Euclidean sums and hulls of cyclic codes of length n over \(R_{q,v}\) R q , v . Then, we exhibit a method of constructing new quantum error-correcting (abbreviated to QEC) codes via the Euclidean sums of cyclic codes over \(R_{q,v}\) R q , v and CSS constructions. Finally, we construct two new classes of entanglement-assisted quantum error-correcting (abbreviated to EAQEC) codes by means of the Euclidean hulls of cyclic codes of length n over \(R_{q,v}\) R q , v . In addition, to enrich the variety of available QEC and EAQEC codes, many new QEC and EAQEC codes are constructed to illustrate our results.