<p>Let <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40995_2025_1781_Article_IEq3.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="101" /> </InlineMediaObject> <EquationSource Format="TEX">\({\mathfrak {R}}={\mathbb {Z}}_{2}+u{\mathbb {Z}}_{2}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="fraktur">R</mi> <mo>=</mo> <msub> <mi mathvariant="double-struck">Z</mi> <mn>2</mn> </msub> <mo>+</mo> <mi>u</mi> <msub> <mi mathvariant="double-struck">Z</mi> <mn>2</mn> </msub> </mrow> </math></EquationSource> </InlineEquation>, where <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40995_2025_1781_Article_IEq4.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="48" /> </InlineMediaObject> <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>, and <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40995_2025_1781_Article_IEq5.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="199" /> </InlineMediaObject> <EquationSource Format="TEX">\({\textbf {S}}={\mathbb {Z}}_{2}+u{\mathbb {Z}}_{2}+v{\mathbb {Z}}_{2}+uv{\mathbb {Z}}_{2}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="bold">S</mi> <mo>=</mo> <msub> <mi mathvariant="double-struck">Z</mi> <mn>2</mn> </msub> <mo>+</mo> <mi>u</mi> <msub> <mi mathvariant="double-struck">Z</mi> <mn>2</mn> </msub> <mo>+</mo> <mi>v</mi> <msub> <mi mathvariant="double-struck">Z</mi> <mn>2</mn> </msub> <mo>+</mo> <mi>u</mi> <mi>v</mi> <msub> <mi mathvariant="double-struck">Z</mi> <mn>2</mn> </msub> </mrow> </math></EquationSource> </InlineEquation>, where <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40995_2025_1781_Article_IEq6.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="85" /> </InlineMediaObject> <EquationSource Format="TEX">\(u^{2}=v^{2}=0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mi>u</mi> <mn>2</mn> </msup> <mo>=</mo> <msup> <mi>v</mi> <mn>2</mn> </msup> <mo>=</mo> <mn>0</mn> </mrow> </math></EquationSource> </InlineEquation>, <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40995_2025_1781_Article_IEq7.gif" Format="GIF" Height="10" Rendition="HTML" Resolution="72" Type="Linedraw" Width="62" /> </InlineMediaObject> <EquationSource Format="TEX">\(uv=vu\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>u</mi> <mi>v</mi> <mo>=</mo> <mi>v</mi> <mi>u</mi> </mrow> </math></EquationSource> </InlineEquation>. In this article, we study <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40995_2025_1781_Article_IEq8.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="26" /> </InlineMediaObject> <EquationSource Format="TEX">\({\mathfrak {R}} {\textbf {S}}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="fraktur">R</mi> <mi mathvariant="bold">S</mi> </mrow> </math></EquationSource> </InlineEquation>-additive cyclic, additive constacyclic, and additive dual codes. We find the structural properties of these codes. The code <i>C</i> is characterized as an <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40995_2025_1781_Article_IEq9.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="29" /> </InlineMediaObject> <EquationSource Format="TEX">\({\textbf {S}}[y]\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="bold">S</mi> <mo stretchy="false">[</mo> <mi>y</mi> <mo stretchy="false">]</mo> </mrow> </math></EquationSource> </InlineEquation>-submodules of the ring <InlineEquation ID="IEq10"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40995_2025_1781_Article_IEq10.gif" Format="GIF" Height="21" Rendition="HTML" Resolution="72" Type="Linedraw" Width="290" /> </InlineMediaObject> <EquationSource Format="TEX">\({\textbf {S}}_{\beta _{1},\beta _{2}}={{\mathfrak {R}}[y]/\langle y^{\beta _{1}}-1\rangle }\times {{\textbf {S}}[y]/\langle y^{\beta _{2}}-1\rangle }\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="bold">S</mi> <mrow> <msub> <mi>β</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>β</mi> <mn>2</mn> </msub> </mrow> </msub> <mo>=</mo> <mrow> <mi mathvariant="fraktur">R</mi> <mrow> <mo stretchy="false">[</mo> <mi>y</mi> <mo stretchy="false">]</mo> </mrow> <mo stretchy="false">/</mo> <mrow> <mo stretchy="false">⟨</mo> <msup> <mi>y</mi> <msub> <mi>β</mi> <mn>1</mn> </msub> </msup> <mo>-</mo> <mn>1</mn> <mo stretchy="false">⟩</mo> </mrow> </mrow> <mo>×</mo> <mrow> <mi mathvariant="bold">S</mi> <mrow> <mo stretchy="false">[</mo> <mi>y</mi> <mo stretchy="false">]</mo> </mrow> <mo stretchy="false">/</mo> <mrow> <mo stretchy="false">⟨</mo> <msup> <mi>y</mi> <msub> <mi>β</mi> <mn>2</mn> </msub> </msup> <mo>-</mo> <mn>1</mn> <mo stretchy="false">⟩</mo> </mrow> </mrow> </mrow> </math></EquationSource> </InlineEquation>. We define the extended Gray map <InlineEquation ID="IEq11"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40995_2025_1781_Article_IEq11.gif" Format="GIF" Height="22" Rendition="HTML" Resolution="72" Type="Linedraw" Width="161" /> </InlineMediaObject> <EquationSource Format="TEX">\(\Psi _{1}:{\mathfrak {R}}^{\beta _{1}}\times {\textbf {S}}^{\beta _2}\longrightarrow {\mathbb {Z}}_{2}^{n}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="normal">Ψ</mi> <mn>1</mn> </msub> <mo>:</mo> <msup> <mrow> <mi mathvariant="fraktur">R</mi> </mrow> <msub> <mi>β</mi> <mn>1</mn> </msub> </msup> <mo>×</mo> <msup> <mrow> <mi mathvariant="bold">S</mi> </mrow> <msub> <mi>β</mi> <mn>2</mn> </msub> </msup> <mo stretchy="false">⟶</mo> <msubsup> <mi mathvariant="double-struck">Z</mi> <mrow> <mn>2</mn> </mrow> <mi>n</mi> </msubsup> </mrow> </math></EquationSource> </InlineEquation> and use this map to find the binary images with good parameters. We also obtain the minimal generating polynomials and minimal spanning sets of the above-mentioned codes. Further, we provide some examples to support of <InlineEquation ID="IEq12"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40995_2025_1781_Article_IEq8.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="26" /> </InlineMediaObject> <EquationSource Format="TEX">\({\mathfrak {R}} {\textbf {S}}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="fraktur">R</mi> <mi mathvariant="bold">S</mi> </mrow> </math></EquationSource> </InlineEquation>-additive cyclic codes. Finally, we present a Table <InternalRef RefID="Tab1">1</InternalRef> of optimal binary codes.</p>

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

Binary Optimal Codes from \({\mathbb {Z}}_{2}[u]{\mathbb {Z}}_{2}[u,v]\)-Additive Cyclic and Additive Constacyclic Codes

  • Mohd Asim,
  • Mohammad Ashraf,
  • Ghulam Mohammad,
  • Washiqur Rehman,
  • Naim Khan

摘要

Let \({\mathfrak {R}}={\mathbb {Z}}_{2}+u{\mathbb {Z}}_{2}\) R = Z 2 + u Z 2 , where \(u^2=0\) u 2 = 0 , and \({\textbf {S}}={\mathbb {Z}}_{2}+u{\mathbb {Z}}_{2}+v{\mathbb {Z}}_{2}+uv{\mathbb {Z}}_{2}\) S = Z 2 + u Z 2 + v Z 2 + u v Z 2 , where \(u^{2}=v^{2}=0\) u 2 = v 2 = 0 , \(uv=vu\) u v = v u . In this article, we study \({\mathfrak {R}} {\textbf {S}}\) R S -additive cyclic, additive constacyclic, and additive dual codes. We find the structural properties of these codes. The code C is characterized as an \({\textbf {S}}[y]\) S [ y ] -submodules of the ring \({\textbf {S}}_{\beta _{1},\beta _{2}}={{\mathfrak {R}}[y]/\langle y^{\beta _{1}}-1\rangle }\times {{\textbf {S}}[y]/\langle y^{\beta _{2}}-1\rangle }\) S β 1 , β 2 = R [ y ] / y β 1 - 1 × S [ y ] / y β 2 - 1 . We define the extended Gray map \(\Psi _{1}:{\mathfrak {R}}^{\beta _{1}}\times {\textbf {S}}^{\beta _2}\longrightarrow {\mathbb {Z}}_{2}^{n}\) Ψ 1 : R β 1 × S β 2 Z 2 n and use this map to find the binary images with good parameters. We also obtain the minimal generating polynomials and minimal spanning sets of the above-mentioned codes. Further, we provide some examples to support of \({\mathfrak {R}} {\textbf {S}}\) R S -additive cyclic codes. Finally, we present a Table 1 of optimal binary codes.