<p>Let <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(\mathfrak {R} = \mathbb {F}_{p^m} + u\mathbb {F}_{p^m}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="fraktur">R</mi> <mo>=</mo> <msub> <mi mathvariant="double-struck">F</mi> <msup> <mi>p</mi> <mi>m</mi> </msup> </msub> <mo>+</mo> <mi>u</mi> <msub> <mi mathvariant="double-struck">F</mi> <msup> <mi>p</mi> <mi>m</mi> </msup> </msub> </mrow> </math></EquationSource> </InlineEquation> with <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(u^2 = 0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mi>u</mi> <mn>2</mn> </msup> <mo>=</mo> <mn>0</mn> </mrow> </math></EquationSource> </InlineEquation>, where <InlineEquation ID="IEq9"> <EquationSource Format="TEX">\(p\)</EquationSource> <EquationSource Format="MATHML"><math> <mi>p</mi> </math></EquationSource> </InlineEquation> is an odd prime and <InlineEquation ID="IEq10"> <EquationSource Format="TEX">\(m\)</EquationSource> <EquationSource Format="MATHML"><math> <mi>m</mi> </math></EquationSource> </InlineEquation> is a positive integer. In this paper, we investigate the algebraic structure of skew constacyclic codes of length <InlineEquation ID="IEq11"> <EquationSource Format="TEX">\(4p^s\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>4</mn> <msup> <mi>p</mi> <mi>s</mi> </msup> </mrow> </math></EquationSource> </InlineEquation> over both the finite field <InlineEquation ID="IEq12"> <EquationSource Format="TEX">\(\mathbb {F}_{p^m}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="double-struck">F</mi> <msup> <mi>p</mi> <mi>m</mi> </msup> </msub> </math></EquationSource> </InlineEquation> and the finite chain ring <InlineEquation ID="IEq13"> <EquationSource Format="TEX">\(\mathfrak {R}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="fraktur">R</mi> </math></EquationSource> </InlineEquation>, along with their duals. We derive the factorization of the polynomial <InlineEquation ID="IEq14"> <EquationSource Format="TEX">\(x^{4p^s} - \lambda \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mi>x</mi> <mrow> <mn>4</mn> <msup> <mi>p</mi> <mi>s</mi> </msup> </mrow> </msup> <mo>-</mo> <mi>λ</mi> </mrow> </math></EquationSource> </InlineEquation> over <InlineEquation ID="IEq15"> <EquationSource Format="TEX">\(\mathbb {F}_{p^m}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="double-struck">F</mi> <msup> <mi>p</mi> <mi>m</mi> </msup> </msub> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq16"> <EquationSource Format="TEX">\(\mathfrak {R}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="fraktur">R</mi> </math></EquationSource> </InlineEquation>, under various conditions on <InlineEquation ID="IEq17"> <EquationSource Format="TEX">\(p\)</EquationSource> <EquationSource Format="MATHML"><math> <mi>p</mi> </math></EquationSource> </InlineEquation> and the unit <InlineEquation ID="IEq18"> <EquationSource Format="TEX">\(\lambda \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>λ</mi> </math></EquationSource> </InlineEquation>, specifically when <InlineEquation ID="IEq19"> <EquationSource Format="TEX">\(p \equiv 1 \pmod {4}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mo>≡</mo> <mn>1</mn> <mspace width="4.44443pt" /> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mn>4</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> or <InlineEquation ID="IEq20"> <EquationSource Format="TEX">\(p \equiv 3 \pmod {4}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mo>≡</mo> <mn>3</mn> <mspace width="4.44443pt" /> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mn>4</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>, and when <InlineEquation ID="IEq21"> <EquationSource Format="TEX">\(\lambda \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>λ</mi> </math></EquationSource> </InlineEquation> is a quadratic residue or non-residue. In particular, for <InlineEquation ID="IEq22"> <EquationSource Format="TEX">\(p \equiv 3 \pmod {4}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mo>≡</mo> <mn>3</mn> <mspace width="4.44443pt" /> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mn>4</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> and non-quadratic <InlineEquation ID="IEq23"> <EquationSource Format="TEX">\(\lambda \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>λ</mi> </math></EquationSource> </InlineEquation>, we obtain the factorization <InlineEquation ID="IEq24"> <EquationSource Format="TEX">\(x^{4p^s} - \lambda = \left( x^2 - \gamma x + \tfrac{\gamma ^2}{2}\right) ^{p^s} \left( x^2 + \gamma x + \tfrac{\gamma ^2}{2}\right) ^{p^s}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mi>x</mi> <mrow> <mn>4</mn> <msup> <mi>p</mi> <mi>s</mi> </msup> </mrow> </msup> <mo>-</mo> <mi>λ</mi> <mo>=</mo> <msup> <mfenced close=")" open="("> <msup> <mi>x</mi> <mn>2</mn> </msup> <mo>-</mo> <mi>γ</mi> <mi>x</mi> <mo>+</mo> <mstyle displaystyle="false" scriptlevel="0"> <mfrac> <msup> <mi>γ</mi> <mn>2</mn> </msup> <mn>2</mn> </mfrac> </mstyle> </mfenced> <msup> <mi>p</mi> <mi>s</mi> </msup> </msup> <msup> <mfenced close=")" open="("> <msup> <mi>x</mi> <mn>2</mn> </msup> <mo>+</mo> <mi>γ</mi> <mi>x</mi> <mo>+</mo> <mstyle displaystyle="false" scriptlevel="0"> <mfrac> <msup> <mi>γ</mi> <mn>2</mn> </msup> <mn>2</mn> </mfrac> </mstyle> </mfenced> <msup> <mi>p</mi> <mi>s</mi> </msup> </msup> </mrow> </math></EquationSource> </InlineEquation>, where <InlineEquation ID="IEq25"> <EquationSource Format="TEX">\(\gamma \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>γ</mi> </math></EquationSource> </InlineEquation> is a root of <InlineEquation ID="IEq26"> <EquationSource Format="TEX">\(x^4 + 4\lambda = 0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mi>x</mi> <mn>4</mn> </msup> <mo>+</mo> <mn>4</mn> <mi>λ</mi> <mo>=</mo> <mn>0</mn> </mrow> </math></EquationSource> </InlineEquation>. We further classify skew constacyclic codes via the structure of left ideals in the quotient ring <InlineEquation ID="IEq27"> <EquationSource Format="TEX">\(\mathfrak {R}[x;\Pi ]/\langle (x^2 + \theta \gamma x + \tfrac{\gamma ^2}{2})^{p^s} \rangle \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="fraktur">R</mi> <mrow> <mo stretchy="false">[</mo> <mi>x</mi> <mo>;</mo> <mi mathvariant="normal">Π</mi> <mo stretchy="false">]</mo> </mrow> <mo stretchy="false">/</mo> <mo stretchy="false">⟨</mo> <msup> <mrow> <mo stretchy="false">(</mo> <msup> <mi>x</mi> <mn>2</mn> </msup> <mo>+</mo> <mi>θ</mi> <mi>γ</mi> <mi>x</mi> <mo>+</mo> <mstyle displaystyle="false" scriptlevel="0"> <mfrac> <msup> <mi>γ</mi> <mn>2</mn> </msup> <mn>2</mn> </mfrac> </mstyle> <mo stretchy="false">)</mo> </mrow> <msup> <mi>p</mi> <mi>s</mi> </msup> </msup> <mo stretchy="false">⟩</mo> </mrow> </math></EquationSource> </InlineEquation>, where <InlineEquation ID="IEq28"> <EquationSource Format="TEX">\(\theta \in \{-1, 1\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>θ</mi> <mo>∈</mo> <mo stretchy="false">{</mo> <mo>-</mo> <mn>1</mn> <mo>,</mo> <mn>1</mn> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq29"> <EquationSource Format="TEX">\(\Pi \)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="normal">Π</mi> </math></EquationSource> </InlineEquation> is an <InlineEquation ID="IEq30"> <EquationSource Format="TEX">\(\mathbb {F}_p\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="double-struck">F</mi> <mi>p</mi> </msub> </math></EquationSource> </InlineEquation>-automorphism of <InlineEquation ID="IEq31"> <EquationSource Format="TEX">\(\mathfrak {R}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="fraktur">R</mi> </math></EquationSource> </InlineEquation>. The torsion and residue codes associated with these codes are analyzed, and the total number of codewords is determined. Several illustrative examples are presented, including cases where the resulting codes attain the MDS (maximum distance separable) bound.</p>

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

Skew constacyclic codes of length \(4p^s\) over \(\mathbb {F}_{p^m} + u\mathbb {F}_{p^m}\)

  • Rishi Raj,
  • Sachin Pathak,
  • Dipendu Maity

摘要

Let \(\mathfrak {R} = \mathbb {F}_{p^m} + u\mathbb {F}_{p^m}\) R = F p m + u F p m with \(u^2 = 0\) u 2 = 0 , where \(p\) p is an odd prime and \(m\) m is a positive integer. In this paper, we investigate the algebraic structure of skew constacyclic codes of length \(4p^s\) 4 p s over both the finite field \(\mathbb {F}_{p^m}\) F p m and the finite chain ring \(\mathfrak {R}\) R , along with their duals. We derive the factorization of the polynomial \(x^{4p^s} - \lambda \) x 4 p s - λ over \(\mathbb {F}_{p^m}\) F p m and \(\mathfrak {R}\) R , under various conditions on \(p\) p and the unit \(\lambda \) λ , specifically when \(p \equiv 1 \pmod {4}\) p 1 ( mod 4 ) or \(p \equiv 3 \pmod {4}\) p 3 ( mod 4 ) , and when \(\lambda \) λ is a quadratic residue or non-residue. In particular, for \(p \equiv 3 \pmod {4}\) p 3 ( mod 4 ) and non-quadratic \(\lambda \) λ , we obtain the factorization \(x^{4p^s} - \lambda = \left( x^2 - \gamma x + \tfrac{\gamma ^2}{2}\right) ^{p^s} \left( x^2 + \gamma x + \tfrac{\gamma ^2}{2}\right) ^{p^s}\) x 4 p s - λ = x 2 - γ x + γ 2 2 p s x 2 + γ x + γ 2 2 p s , where \(\gamma \) γ is a root of \(x^4 + 4\lambda = 0\) x 4 + 4 λ = 0 . We further classify skew constacyclic codes via the structure of left ideals in the quotient ring \(\mathfrak {R}[x;\Pi ]/\langle (x^2 + \theta \gamma x + \tfrac{\gamma ^2}{2})^{p^s} \rangle \) R [ x ; Π ] / ( x 2 + θ γ x + γ 2 2 ) p s , where \(\theta \in \{-1, 1\}\) θ { - 1 , 1 } and \(\Pi \) Π is an \(\mathbb {F}_p\) F p -automorphism of \(\mathfrak {R}\) R . The torsion and residue codes associated with these codes are analyzed, and the total number of codewords is determined. Several illustrative examples are presented, including cases where the resulting codes attain the MDS (maximum distance separable) bound.