<p>Codes over non-unitary rings have been studied recently. In particular, codes over the commutative non-unitary ring <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(I_p\)</EquationSource> </InlineEquation> (in the classification of Fine) of order <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(p^2\)</EquationSource> </InlineEquation> where <i>p</i> is a prime are being considered. For <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(p=2\)</EquationSource> </InlineEquation> (resp. <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(p=3\)</EquationSource> </InlineEquation>), three categories of codes over <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(I_p\)</EquationSource> </InlineEquation> have been studied: self-orthogonal codes, quasi self-dual codes, and self-dual codes over <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(I_p\)</EquationSource> </InlineEquation>. Using some related mass formulas and building-up constructions, classifications of these codes have been done up to the permutation equivalence (resp. the monomial equivalence) for certain small lengths. In this paper, we take the prime <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(p=5\)</EquationSource> </InlineEquation> and consider the ring <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(I_5\)</EquationSource> </InlineEquation>. We introduce the notion of linear codes over <InlineEquation ID="IEq9"> <EquationSource Format="TEX">\(I_5\)</EquationSource> </InlineEquation>. We also define the same three categories of linear <InlineEquation ID="IEq10"> <EquationSource Format="TEX">\(I_5\)</EquationSource> </InlineEquation>-codes, study the structures of these <InlineEquation ID="IEq11"> <EquationSource Format="TEX">\(I_5\)</EquationSource> </InlineEquation>-codes and relate them to their associated residue and torsion codes. We classify the three categories of codes completely in lengths at most 4 up to the monomial equivalence for a given type <InlineEquation ID="IEq12"> <EquationSource Format="TEX">\(\{k_1, k_2\}\)</EquationSource> </InlineEquation>. Moreover, in the paper of Alahmadi et al. regarding the mass formula for self-orthogonal codes over <InlineEquation ID="IEq13"> <EquationSource Format="TEX">\(I_p\)</EquationSource> </InlineEquation>, mistakes in the classification of quasi self-dual codes over <InlineEquation ID="IEq14"> <EquationSource Format="TEX">\(I_5\)</EquationSource> </InlineEquation> had been made such as incorrect automorphism group order of some codes or inconsistency with the mass formula for self-orthogonal codes over <InlineEquation ID="IEq15"> <EquationSource Format="TEX">\(I_p\)</EquationSource> </InlineEquation> for length <InlineEquation ID="IEq16"> <EquationSource Format="TEX">\(n=2\)</EquationSource> </InlineEquation> and type <InlineEquation ID="IEq17"> <EquationSource Format="TEX">\(\{1, 0\}\)</EquationSource> </InlineEquation> and for length <InlineEquation ID="IEq18"> <EquationSource Format="TEX">\(n=3\)</EquationSource> </InlineEquation> and type <InlineEquation ID="IEq19"> <EquationSource Format="TEX">\(\{1, 1\}\)</EquationSource> </InlineEquation>. We correct and improve such results.</p>

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

Construction of self-orthogonal codes over a commutative non-unitary ring of order 25

  • Jon-Lark Kim,
  • Marvin Olavides,
  • Young Gun Roe

摘要

Codes over non-unitary rings have been studied recently. In particular, codes over the commutative non-unitary ring \(I_p\) (in the classification of Fine) of order \(p^2\) where p is a prime are being considered. For \(p=2\) (resp. \(p=3\) ), three categories of codes over \(I_p\) have been studied: self-orthogonal codes, quasi self-dual codes, and self-dual codes over \(I_p\) . Using some related mass formulas and building-up constructions, classifications of these codes have been done up to the permutation equivalence (resp. the monomial equivalence) for certain small lengths. In this paper, we take the prime \(p=5\) and consider the ring \(I_5\) . We introduce the notion of linear codes over \(I_5\) . We also define the same three categories of linear \(I_5\) -codes, study the structures of these \(I_5\) -codes and relate them to their associated residue and torsion codes. We classify the three categories of codes completely in lengths at most 4 up to the monomial equivalence for a given type \(\{k_1, k_2\}\) . Moreover, in the paper of Alahmadi et al. regarding the mass formula for self-orthogonal codes over \(I_p\) , mistakes in the classification of quasi self-dual codes over \(I_5\) had been made such as incorrect automorphism group order of some codes or inconsistency with the mass formula for self-orthogonal codes over \(I_p\) for length \(n=2\) and type \(\{1, 0\}\) and for length \(n=3\) and type \(\{1, 1\}\) . We correct and improve such results.