<p>In this paper, we employ group rings and skew group rings to construct binary self-dual codes of length 72. There is a well known map <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40314_2024_3056_Article_IEq4.gif" Format="GIF" Height="10" Rendition="HTML" Resolution="72" Type="Linedraw" Width="13" /> </InlineMediaObject> <EquationSource Format="TEX">\(\sigma \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>σ</mi> </math></EquationSource> </InlineEquation> that sends a (skew) group ring element to an <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40314_2024_3056_Article_IEq5.gif" Format="GIF" Height="13" Rendition="HTML" Resolution="72" Type="Linedraw" Width="45" /> </InlineMediaObject> <EquationSource Format="TEX">\(n\times n\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>×</mo> <mi>n</mi> </mrow> </math></EquationSource> </InlineEquation> matrix. By using groups of order <i>n</i>, we obtain a lot of generator matrices of the form <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40314_2024_3056_Article_IEq6.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="76" /> </InlineMediaObject> <EquationSource Format="TEX">\((I_{n}\mid \sigma _{\varphi }(v)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">(</mo> <msub> <mi>I</mi> <mi>n</mi> </msub> <mo>∣</mo> <msub> <mi>σ</mi> <mi>φ</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>v</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>), where <i>v</i> is an element in a (skew) group ring. Then through special maps, we can send a self-dual code of length 2<i>n</i> over <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40314_2024_3056_Article_IEq7.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="23" /> </InlineMediaObject> <EquationSource Format="TEX">\({\mathbb {F}}_{2^t}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="double-struck">F</mi> <msup> <mn>2</mn> <mi>t</mi> </msup> </msub> </math></EquationSource> </InlineEquation> to a binary self-dual code of length 2<i>tn</i>. We use these generator matrices to search for binary [72,36,12] self-dual codes and obtain many singly-even and doubly-even codes with new parameters in their weight enumerators that were not known in the literature before. We list our findings on a publicly available website.</p>

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

New binary \(\left[ 72,36,12\right] \) self-dual codes from group rings and skew group rings

  • Cong Yu,
  • Shixin Zhu,
  • Tingting Wu

摘要

In this paper, we employ group rings and skew group rings to construct binary self-dual codes of length 72. There is a well known map \(\sigma \) σ that sends a (skew) group ring element to an \(n\times n\) n × n matrix. By using groups of order n, we obtain a lot of generator matrices of the form \((I_{n}\mid \sigma _{\varphi }(v)\) ( I n σ φ ( v ) ), where v is an element in a (skew) group ring. Then through special maps, we can send a self-dual code of length 2n over \({\mathbb {F}}_{2^t}\) F 2 t to a binary self-dual code of length 2tn. We use these generator matrices to search for binary [72,36,12] self-dual codes and obtain many singly-even and doubly-even codes with new parameters in their weight enumerators that were not known in the literature before. We list our findings on a publicly available website.