Papers
Topics
Authors
Recent
Search
2000 character limit reached

Left dihedral codes over Galois rings GR(p2,m){\rm GR}(p^2,m)

Published 14 Sep 2016 in cs.IT, math.IT, and math.RA | (1609.04083v1)

Abstract: Let D2n=⟨x,y∣x<sup>n=1,</sup>y<sup>2=1,</sup>yxy=x<sup>−1⟩D_{2n}=\langle x,y\mid x<sup>n=1,</sup> y<sup>2=1,</sup> yxy=x<sup>{-1}\rangle be a dihedral group, and R=GR(p<sup>2,m)R={\rm GR}(p<sup>2,m) be a Galois ring of characteristic p<sup>2p<sup>2 and cardinality p<sup>2mp<sup>{2m} where pp is a prime. Left ideals of the group ring R[D2n]R[D_{2n}] are called left dihedral codes over RR of length $2n$, and abbreviated as left D2nD_{2n}-codes over RR. Let gcd(n,p)=1{\rm gcd}(n,p)=1 in this paper. Then any left D2nD_{2n}-code over RR is uniquely decomposed into a direct sum of concatenated codes with inner codes A<em>i{\cal A}<em>i and outer codes CiC_i, where Ai{\cal A}_i is a cyclic code over RR of length nn and CiC_i is a skew cyclic code of length $2$ over an extension Galois ring or principal ideal ring of RR, and a generator matrix and basic parameters for each outer code CiC_i is given. Moreover, a formula to count the number of these codes is obtained, the dual code for each left D</em>2nD</em>{2n}-code is determined and all self-dual left D2nD_{2n}-codes and self-orthogonal left D2nD_{2n}-codes over RR are presented, respectively.

Authors (3)
Citations (10)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.