<p>We investigate <i>m</i>-adic residue codes of prime length <i>p</i> over the mixed-alphabet ring <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(\mathbb {F}_q S,\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="double-struck">F</mi> <mi>q</mi> </msub> <mi>S</mi> <mo>,</mo> </mrow> </math></EquationSource> </InlineEquation> where <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(S=\mathbb {F}_q+v\mathbb {F}_q\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>S</mi> <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> </mrow> </math></EquationSource> </InlineEquation> with <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(v^2=v,\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mi>v</mi> <mn>2</mn> </msup> <mo>=</mo> <mi>v</mi> <mo>,</mo> </mrow> </math></EquationSource> </InlineEquation> assuming <i>q</i> is an odd prime power with <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(\gcd (p,q)=1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo movablelimits="true">gcd</mo> <mo stretchy="false">(</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo stretchy="false">)</mo> <mo>=</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(m\mid (p-1).\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>m</mi> <mo>∣</mo> <mo stretchy="false">(</mo> <mi>p</mi> <mo>-</mo> <mn>1</mn> <mo stretchy="false">)</mo> <mo>.</mo> </mrow> </math></EquationSource> </InlineEquation> Using the structural decomposition <InlineEquation ID="IEq9"> <EquationSource Format="TEX">\(\mathbb {F}_q S \cong \mathbb {F}_q^3,\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="double-struck">F</mi> <mi>q</mi> </msub> <mi>S</mi> <mo>≅</mo> <msubsup> <mi mathvariant="double-struck">F</mi> <mi>q</mi> <mn>3</mn> </msubsup> <mo>,</mo> </mrow> </math></EquationSource> </InlineEquation> we describe cyclic codes as principal ideals generated by lifted orthogonal idempotents and classify them into even-like and odd-like families of Class&#xa0;I and Class&#xa0;II, with explicit generators, orthogonality relations, and size formulas. A Gray map from <InlineEquation ID="IEq10"> <EquationSource Format="TEX">\(\mathbb {F}_q S\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="double-struck">F</mi> <mi>q</mi> </msub> <mi>S</mi> </mrow> </math></EquationSource> </InlineEquation> to <InlineEquation ID="IEq11"> <EquationSource Format="TEX">\(\mathbb {F}_q^3\)</EquationSource> <EquationSource Format="MATHML"><math> <msubsup> <mi mathvariant="double-struck">F</mi> <mi>q</mi> <mn>3</mn> </msubsup> </math></EquationSource> </InlineEquation> is introduced, together with a Lee weight and a Gray-induced bilinear form, yielding Lee distance bounds in terms of the three cyclic constituents over <InlineEquation ID="IEq12"> <EquationSource Format="TEX">\(\mathbb {F}_q.\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="double-struck">F</mi> <mi>q</mi> </msub> <mo>.</mo> </mrow> </math></EquationSource> </InlineEquation> At the idempotent level, we determine dual codes by analyzing the action of the reciprocal automorphism (and, when <InlineEquation ID="IEq13"> <EquationSource Format="TEX">\(q=r^2,\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>q</mi> <mo>=</mo> <msup> <mi>r</mi> <mn>2</mn> </msup> <mo>,</mo> </mrow> </math></EquationSource> </InlineEquation> the Frobenius automorphism), and derive a combinatorial disjoint-support criterion on index sets that guarantees the required dual containment for both Euclidean and Hermitian inner products. This leads to a unified framework for constructing Euclidean and Hermitian CSS-type quantum stabilizer codes over <InlineEquation ID="IEq14"> <EquationSource Format="TEX">\(\mathbb {F}_q,\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="double-struck">F</mi> <mi>q</mi> </msub> <mo>,</mo> </mrow> </math></EquationSource> </InlineEquation> with parameters expressed in terms of the degrees of the underlying generator polynomials. Explicit examples illustrate the resulting classical and quantum code families.</p>

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

m-adic residue codes over \(\mathbb {F}_q S\) and CSS quantum constructions

  • Eda Tekin

摘要

We investigate m-adic residue codes of prime length p over the mixed-alphabet ring \(\mathbb {F}_q S,\) F q S , where \(S=\mathbb {F}_q+v\mathbb {F}_q\) S = F q + v F q with \(v^2=v,\) v 2 = v , assuming q is an odd prime power with \(\gcd (p,q)=1\) gcd ( p , q ) = 1 and \(m\mid (p-1).\) m ( p - 1 ) . Using the structural decomposition \(\mathbb {F}_q S \cong \mathbb {F}_q^3,\) F q S F q 3 , we describe cyclic codes as principal ideals generated by lifted orthogonal idempotents and classify them into even-like and odd-like families of Class I and Class II, with explicit generators, orthogonality relations, and size formulas. A Gray map from \(\mathbb {F}_q S\) F q S to \(\mathbb {F}_q^3\) F q 3 is introduced, together with a Lee weight and a Gray-induced bilinear form, yielding Lee distance bounds in terms of the three cyclic constituents over \(\mathbb {F}_q.\) F q . At the idempotent level, we determine dual codes by analyzing the action of the reciprocal automorphism (and, when \(q=r^2,\) q = r 2 , the Frobenius automorphism), and derive a combinatorial disjoint-support criterion on index sets that guarantees the required dual containment for both Euclidean and Hermitian inner products. This leads to a unified framework for constructing Euclidean and Hermitian CSS-type quantum stabilizer codes over \(\mathbb {F}_q,\) F q , with parameters expressed in terms of the degrees of the underlying generator polynomials. Explicit examples illustrate the resulting classical and quantum code families.