LCD Codes and Self-orthogonal Codes in Finite Dihedral Group Algebras∗
2021-11-03YanyanGAOQinYUEYanshengWU
Yanyan GAO Qin YUE Yansheng WU
Abstract Let Fq be a finite field with order q and D2n be the dihedral group with 2n elements, and gcd(q,2n) = 1. In this article, the authors give precise descriptions and enumerations of linear complementary dual (LCD) codes and self-orthogonal codes in the finite dihedral group algebras Fq[D2n]. Some numerical examples are also presented to illustrate the main results.
Keywords Group algebra, Dihedral group, LCD codes, Self-orthogonal codes
1 Introduction
Group algebra is one of the important sources of constructing linear codes. We call C a group code if C is just a right ideal in a group ringR[G], whereRis a commutative ring andGis a finite group. In particular, ifGis abelian, then C is an abelian code. A brief survey on group codes of some recent results is provided as follows.
(1) Ferraz et al. [10] determined the number of simple components of a semisimple finite abelian group algebra, in term of the number ofq-cyclotomic classes.
(2)Brochero Mart´ınez et al. [3] determined an explicit expression for the primitive idempotents of Fq[G], where Fqis a finite field,Gis a finite cyclic group of orderpk, andpis an odd prime with gcd(q,p) = 1. Brochero Mart´ınez [2] also showed explicitly all central irreducible idempotents and their Wedderburn decomposition of the dihedral group algebra Fq[D2n]if every prime divisor ofndividesq−1.
(3) Polcino Milies et al. [17] calculated the minimum distances and the dimensions of all cyclic codes of lengthpnover a finite field Fq.Ifpis an odd prime, Fqis a finite field withqelements, andqgenerates the group of invertible elements of the residue ring modulepn,denoted by Zpn.
(4)Jitman et al. [12]gave a characterization and an enumeration of Euclidean self-dual and Euclidean self-orthogonal abelian codes in principal ideal group algebras. Then Jitman et al.continued this work and studied the Hermitian self-dual abelian codes in a group ring Fq2[G]in [13].
(5) Choosuwan et al. [6] gave the complete enumeration of self-dual abelian codes in nonprincipal ideal group algebras F2k[A×Z×Z2s]with respect to both the Euclidean and Hermitian inner products, wherekandsare positive andAis an abelian group of odd order.
(6) In 2017, Boripan et al. [1] studied a family of abelian codes with complementary dual in a group algebra Fpv[G] in the two cases of Euclidean and Hermitian inner products, wherepis a prime,vis a positive integer, andGis an arbitrary finite abelian group.
(7) Cao et al. [7] proved that any leftD2n-code (left ideal of the group algebra Fq[D2n]with gcd(q,2n)=1)is a direct sum of concatenated codes with inner codesAiand outer codesCi, whereAiis a minimal self-reciprocal cyclic code over Fqof lengthnandCiis a skew cyclic code of length 2 over an extension field or principal ideal ring of Fq. Cao et al. also extended the results of [7] to the left dihedral codes over Galois ringsGR(p2,n) in [8].
Linear complementary dual (LCD for short) codes are a class of linear codes introduced by Massey [14] in 1964. LCD codes have been extensively studied in literature recently. Carlet et al. [5] introduced a general construction of LCD codes from linear codes. Mesnager et al. [15]provided a construction scheme for obtaining LCD codes from any algebraic curve. Carlet et. al[4] investigated several constructions of new Euclidean and Hermitian LCD maximum distance separable (MDS for short) code using some linear codes with small dimension or codimension,self-orthogonal codes and generalized Reed-Solomon codes.
In this paper,we give precise descriptions and enumerations of LCD codes and self-orthogonal codes in the finite dihedral group algebras Fq[D2n] if gcd(q,2n)=1. Some numerical examples are also presented to illustrate our main results.
The present paper is organized as follows. In Section 2, we give a review of some properties of group algebras and some other preliminaries. In Section 3, we prove our main results. In Section 4, as examples, we count the numbers of all LCD and self-orthgonal codes for the following dihedral group algebras: (i) forq= 3, F3[D14],F3[D16],F3[D26]; (ii) forq= 5,F5[D16],F5[D26].
2 Preliminaries
2.1 Group algebras
Let Fqbe a finite field andGa finite group. The group algebra Fq[G] is defined as the vector over Fqwith basisG, and it has scalar, additive and multiplicative operators as follows:Forc,ag,bg∈Fqandg∈G,


Then Fq[G] is an associative Fq-algebra with the identity 1=1Fq1G, where 1Fqand 1Gare the identity elements of FqandG, respectively. Readers are referred to [16, 18] for more details on group ring or group algebra.
Define the (standard) inner product on Fq[G] as follows: Forα=Fq[G],

If C is a right ideal of Fq[G], then C is a linear code over Fq. Hence the dual code of C is defined as

If C ⊆C⊥, then C is called a self-orthogonal code. Ifthen C is called a linear complementary dual code, or shortly an LCD code. One has the following simple fact: Ifg,h∈G, then

Suppose thatα,β∈Fq[G] andg∈G. Then

which is calledG-invariance. Suppose thatThenwt(α) = |{ag/= 0|g∈G}| is called the Hamming weight ofα.
2.2 Some lemmas
Lemma 2.1(see Maschke’s Theorem [18])Let R be a ring and G be a group. Then the group ring R[G]is semisimple if and only if the following conditions hold.
(i)R is a semisimple ring.
(ii)G is finite.
(iii) |G|is invertible in R.
By Lemma 2.1, it is easy to verify that Fq[G] is semisimple if and only ifGis a finite group and char(Fq)∤|G|. By the Wedderburn-Artin theorem, Fq[G] is isomorphic to a direct sum of matrix algebras over division rings, such that each division algebra is a finite algebra over Fq,i.e., there is an isomorphism of Fq-algebra:

whereDjare fields such thatHence,every right ideal of Fq[G]is generated by an idempotent of Fq[G]. Observe that Fq[G] hastcentral irreducible idempotents, each one of the form

whereIiare the identity matrices of the componentMli(Di) for 1 ≤i≤t.
Let Fqbe a finite field of orderqandnbe a positive integer with gcd(2n,q) = 1. For any monic polynomialg(x)∈Fq[x] withg(0)=a0/=0,g∗(x) denotes the reciprocal polynomial ofg(x), i.e.,g∗(x) =a−10xdeg(g)g(1x). We say thatg(x) is a self-reciprocal polynomial ifg(x) =g∗(x). Suppose that there is an irreducible factorization ofxn−1 over Fqas follows:

wherefi(x)=f∗i(x),1 ≤i≤r. For convenience, we setf1(x)=x−1 andf2(x)=x+1 ifnis even; andf1(x)=x−1 ifnis odd.
LetCnbe a cyclic group of ordern. It is well known that Fq[Cn]~=Fq[x]/〈xn−1〉. By the Chinese remainder theorem,

Lemma 2.2(see [3])Let I be an ideal ofFq[Cn]generated by the monic polynomial g(x),which is a divisor of xn−1. Set f(x)=Then the principal idempotent of I is

Lemma 2.3(see [2])LetFqbe a finite field with order q and D2n= 〈x,y|xn= 1,y2=1,yxy=x−1〉be the dihedral group with2n elements. Then the group algebraFq[D2n]has the Wedderburn decomposition of the form

where

Observe that, if r+1 ≤j≤r+s, then
Lemma 2.4(see [2])The dihedral group algebraFq[D2n]has δ+r+s central irreducible idempotents:
(1) 2δ idempotents of the formwhere j≤δ,
(2)r−δ idempotents efj, where j=δ+1,···,r, generated by the auto-reciprocals factor of xn−1,
(3)s idempotents efj+ef∗j, where j=r+1,···,r+s.
3 Main Results
The adjoint of an elementSuppose thateis an idempotent of Fq[G]. IfeFq[G] is an irreducible right ideal,eis called an irreducible idempotent. If there is a factorization of orthogonal irreducible idempotents: 1=e1+···+en,then {e1,···,en} is called a complete set of orthogonal idempotents. In fact, for each right idealIof Fq[G],I=whereS⊂{1,···,n}.
Lemma 3.1(see [9])IfCis a right ideal ofFq[G], then the following statements are equivalent:
(a) Cis anLCDcode,
(b) C =eFq[G], where e2=e=e.
In this section, we give the generators and enumerations of LCD codes and self-orthogonal codes in finite dihedral group algebra Fq[D2n]. In the following, we shall find a complete set of orthogonal idempotent with irreducible projective idempotents and irreducible isotropic idempotents by central irreducible idempotents of Fq[D2n] by Lemma 2.4.
Theorem 3.1The dihedral group algebraFq[D2n]has a complete set of orthogonal idempotents with2r irreducible projective idempotents and2s irreducible isotropic idempotents.
Proof(1) As in the proof of Lemma 2.3, letτbe the isomorphism of Fq-algebra defined byNote that

and ifnis even, then

Forj≥δ+1,

whereαjis a root offj(x).
By Lemma 2.2,efj(1 ≤j≤r) are center primitive idempotents of Fq[Cn]. We proceed the proof with the following two cases:
Case 1. Ifj≤δ, then by Lemma 2.4,are orthogonal irreducible idempotents of dihedral group algebra Fq[D2n].
Case 2. Ifδ+ 1 ≤j≤r, then we need to verify thatare idempotents ofM2(Fq(αj)). Sincefj(x)=f∗j(x) andαjis a root offj(x),

Hence

It is obvious thatare orthogonal irreducible idempotents ofM2(Fq(αj)), and moreover,

Next we prove thatefj=by Lemma 3.1. In fact,

wherefj(x) = (x−λj1)(x−λj2)···(x−λjk) ∈Fqt[x], Fq[x]/(fj(x)) ~= Fqt(for some positive integert), and

Then

Sinceλj1,λj2,···,λjkare all roots offj(x),are also all roots offj(x). Hence

and
(2) Next, we need to check thatfor allj=r+1,···,r+s.In fact,fj(x) = (x−λj1)(x−λj2)···(x−λjk) ∈Fqt[x], Fq[x]/(fj(x)) ~= Fqt, andefj=whereThen

Sinceλj1,λj2,···,λjkare all roots offj(x),are also all roots off∗j(x). Hence
Hence

Similarly, we can obtainTherefore
This completes the proof.
For convenience of enumerations, we give the following sets:

Then Δ1∪Δ2is a complete set of orthogonal idempotents in Fq[D2n].
Theorem 3.2There are22r+sLCDcodes in the finite dihedral group algebraFq[D2n].
ProofFor a right ideal C of Fq[D2n], by the Wedderburn-Artin theorem

whereS⊂Δ1∪Δ2. By Lemma 3.1, C is an LCD code if and only if
It is easy to know that the idempotents of Δ1are irreducible projective idempotents. Set

Then Δ1∪Δ′2consists of all irreducible projective idempotents.
The proof is completed.
Lemma 3.2For any α,β,
ProofForg∈G, we only need to verify thatLettingwe obtain that

Therefore, we get 〈gβ,γ〉=and in general, we have 〈αβ,γ〉=
This completes the proof.
Based on Lemma 3.2, we can get the following theorem.
Theorem 3.3LetC =eFq[G]be an right ideal ofFq[G], where e is an idempotent ofFq[G].ThenCis a self-orthogonal code if and only if=0.
ProofFor anyα,β∈Fq[G], we can easily get

The proof is completed.
Theorem 3.4There are3sself-orthogonal codes in the finite dihedral group algebraFq[D2n].
ProofFor a right ideal C of Fq[D2n], by the Wedderburn-Artin theorem

whereS⊂Δ1∪Δ2. By Theorem 3.3. C is a self-orthogonal code if and only if
Suppose that C =fFq[D2n] is a right ideal of Fq[D2n], where

Then C is a self-orthogonal code. The converse also holds. Moreover,from |Δ′2|=s, we obtain the result.
The proof is completed.
4 Examples
In this section, we will give some examples to illustrate our main results.
Example 4.1(i) Letq= 3 andn= 7.We consider the dihedral group algebra F3[D14].Here

where

By Theorem 3.2, there are 24LCD codes in F3[D14].
(ii) Letq=3 andn=8.We consider the dihedral group algebra F3[D16]. Here

where

By Theorem 3.2, there are 27LCD codes in F3[D16]. By Theorem 3.4, there are 3 selforthogonal codes in F3[D16].
(iii) Letq=3 andn=13.We consider the dihedral group algebra F3[D26]. Here

where

By Theorem 3.2, there are 24LCD codes in F3[D26].By Theorem 3.4, there are 32selforthogonal codes in F3[D26].
Example 4.2(i) Letq= 5 andn= 8.We consider the dihedral group algebra F5[D16].Here

where

By Theorem 3.2, there are 26LCD codes in F5[D16]. By Theorem 3.4, there are 32selforthogonal codes in F5[D16].
(ii) Letq=5 andn=13.We consider the dihedral group algebra F5[D26]. Here

where

By Theorem 3.4, there are 28LCD codes in F5[D26].
AcknowledgementThe authors are very grateful to the reviewers and the editor for their valuable comments and suggestions to improve the quality of this paper.
杂志排行
Chinese Annals of Mathematics,Series B的其它文章
- On Descriptions of Products of Simplices∗
- Second Main Theorem for Meromorphic Maps into Algebraic Varieties Intersecting Moving Hypersurfaces Targets∗
- Two Commuting Involutions Fixing RP1(2m+1)∪RP2(2m+1)∗
- Boundedness of Iterated Spherical Average on α-Modulation Spaces∗
- Boundedness of Vector Valued Bilinear Calder´on-Zygmund Operators on Products of Weighted Herz-Morrey Spaces with Variable Exponents∗
- Coburn Type Operators and Compact Perturbations
