Processing math: 100%
Research article

Group codes over symmetric groups

  • Received: 22 April 2023 Revised: 02 June 2023 Accepted: 05 June 2023 Published: 14 June 2023
  • MSC : 94B05

  • Let Fq be a finite field of characteristic q and Sn a symmetric group of order n!. In this paper, group codes in the symmetric group algebras FqSn with q>3 and n=3,4 are proposed. We compute the unique (linear and nonlinear) idempotents of FqSn corresponding to the characters of symmetric groups and use the results to characterize the minimum distances and dimensions of group codes. Furthermore, we construct MDS group codes and almost MDS group codes in FqS3 and FqS4.

    Citation: Yanyan Gao, Yangjiang Wei. Group codes over symmetric groups[J]. AIMS Mathematics, 2023, 8(9): 19842-19856. doi: 10.3934/math.20231011

    Related Papers:

    [1] Yunpeng Bai, Yuanlin Li, Jiangtao Peng . Unit groups of finite group algebras of Abelian groups of order 17 to 20. AIMS Mathematics, 2021, 6(7): 7305-7317. doi: 10.3934/math.2021428
    [2] Lilan Dai, Yunnan Li . Primitive decompositions of idempotents of the group algebras of dihedral groups and generalized quaternion groups. AIMS Mathematics, 2024, 9(10): 28150-28169. doi: 10.3934/math.20241365
    [3] Ted Hurley . Ultimate linear block and convolutional codes. AIMS Mathematics, 2025, 10(4): 8398-8421. doi: 10.3934/math.2025387
    [4] Doris Dumičić Danilović, Andrea Švob . On Hadamard 2-(51,25,12) and 2-(59,29,14) designs. AIMS Mathematics, 2024, 9(8): 23047-23059. doi: 10.3934/math.20241120
    [5] Jiangmin Pan, Yingnan Zhang . On cubic semisymmetric bi-Cayley graphs on nonabelian simple groups. AIMS Mathematics, 2022, 7(7): 12689-12701. doi: 10.3934/math.2022702
    [6] Menderes Gashi . On the symmetric block design with parameters (280,63,14) admitting a Frobenius group of order 93. AIMS Mathematics, 2019, 4(4): 1258-1273. doi: 10.3934/math.2019.4.1258
    [7] Hailin Liu, Longzhi Lu, Liping Zhong . On the proportion of elements of order a product of two primes in finite symmetric groups. AIMS Mathematics, 2024, 9(9): 24394-24400. doi: 10.3934/math.20241188
    [8] Madeleine Al Tahan, Sarka Hoskova-Mayerova, B. Davvaz, A. Sonea . On subpolygroup commutativity degree of finite polygroups. AIMS Mathematics, 2023, 8(10): 23786-23799. doi: 10.3934/math.20231211
    [9] Yongli Zhang, Jiaxin Shen . Flag-transitive non-symmetric 2-designs with λ prime and exceptional groups of Lie type. AIMS Mathematics, 2024, 9(9): 25636-25645. doi: 10.3934/math.20241252
    [10] Hui Yan, Hongxing Wang, Kezheng Zuo, Yang Chen . Further characterizations of the weak group inverse of matrices and the weak group matrix. AIMS Mathematics, 2021, 6(9): 9322-9341. doi: 10.3934/math.2021542
  • Let Fq be a finite field of characteristic q and Sn a symmetric group of order n!. In this paper, group codes in the symmetric group algebras FqSn with q>3 and n=3,4 are proposed. We compute the unique (linear and nonlinear) idempotents of FqSn corresponding to the characters of symmetric groups and use the results to characterize the minimum distances and dimensions of group codes. Furthermore, we construct MDS group codes and almost MDS group codes in FqS3 and FqS4.



    Group codes, a class of important linear codes, play a vital role in error correction coding. A linear code C is called a group code if it is just a one-sided (left or right) ideal in a group algebra R[G], where R is a commutative ring and G is a finite group. If G is abelian, then C is an abelian code.

    A brief survey on group codes of some recent results is provided as follows. Polcino Milies et al. [13] calculated the minimum distances and the dimensions of all cyclic codes of length pn over a finite field Fq, when p is an odd prime and Fq is a finite field with q elements, assuming that ˉq generates the group of invertible elements of the residue ring module pn, denoted by Zpn. Jitman et al. [11] gave a characterization and an enumeration of Euclidean self-dual and Euclidean self-orthogonal abelian codes in a principal ideal group algebra. Choosuwan et al. [5] gave the complete enumeration of self-dual abelian codes in nonprincipal ideal group algebras F2k[A×Z2×Z2s] with respect to both the Euclidean and Hermitian inner products, where k and s are positives and A is an abelian group of odd order. 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, where p is a prime, v is a positive integer, and G is an arbitrary finite abelian group. Cao et al. [3,4] proved that any left D2n-code (left ideal of the group algebra Fq[D2n]) is a direct sum of concatenated codes with inner codes Ai and outer codes Ci, where Ai is a minimal self-reciprocal cyclic code over Fq of length n and Ci is a skew cyclic code of length 2 over an extension field or principal ideal ring of Fq.

    Determining the parameters of linear codes is important, but it is difficult to determine the parameters of group codes in group algebras Fq[G] through the structure of Fq[G]. For instance, Brochero Martínes [2] showed explicitly all central irreducible idempotents and their Wedderburn decomposition of the dihedral group algebra Fq[D2n], in the case when every divisor of n divides q1. Brochero Martínez et al. [12] determined an explicit expression for the primitive idempotents of Fq[G], where Fq is a finite field, G is a finite cyclic group of order pk and p is an odd prime with gcd(q,p)=1. Based on the idea, Gao et al. [7] described and counted all linear complementary dual (LCD) codes and self-orthogonal codes in Fq[D2n,r], where [D2n,r] is a generalized dihedral group. Gao et al. [6] obtained the precise descriptions and enumerations of linear complementary dual (LCD) codes and self-orthogonal codes in the generalized quaternion group algebras Fq[Q4n]. It is a pity that the authors cannot give the parameters of group codes.

    To address this issue, we can use the character label of corresponding groups to determine the idempotents of group algebras. Let Sn be a symmetric group of order n!. In this paper, we propose group codes in symmetric group algebras FqSn with q>3 and n=3,4. We compute the unique (linear and nonlinear) idempotents of FqSn corresponding to the characters of symmetric groups and use the results to characterize the minimum distances and dimensions of group codes. Furthermore, we construct MDS group codes and almost MDS group codes in FqS3 and FqS4.

    The paper is organized as follows: Section 2 provides a review of some properties of group algebras and other preliminaries, while Section 3 investigates group codes in symmetric group algebras FqSn with q>3 and n=3,4, and obtains the parameters of all the above group codes.

    Let Fq[G] be a group algebra, where Fq is a finite field and G is a finite group. In fact, the group algebra Fq[G] is a vector space over Fq with basis G, and it has scalar, additive, and multiplicative operator as follows: for c,ag,bgFq and gG,

    c(gGagg)=gGcagg,
    gGagg+gGbgg=gG(ag+bg)g,
    (gGagg)(hGbhh)=gG(uv=gaubv)g.

    Then Fq[G] is an associative Fq-algebra with the identity 1=1Fq1G, where 1Fq and 1G are the identity elements of Fq and G, respectively. Readers are referred to [14,16] for more details on group ring or group algebra.

    Lemma 2.1. (Maschke's Theorem [14]) 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 if G is a finite group and char(Fq)|G|. Let Fq[G] be a semisimple group algebra. Then Fq[G] can be decomposed into a direct sum Fq[G]=iΩFq[G]ei, where Fq[G]ei is the minimal ideal generated by the idempotent ei,iΩ and Ω is the index set (see [9]). If I is any ideal of Fq[G], then I can be expressed as a direct sum of some minimal ideal Fq[G]ei of Fq[G], i.e., I=iΩ1ΩFq[G]ei. Let I be an ideal generated by a subset Ω1 and Λ=ΩΩ1. Then IIΛ={αFq[G]:αej=0, for all ejΛ}.

    Suppose that α=gGaggFq[G]. Then wt(α)=|{ag:ag0}| is called the Hamming weight of α ([19]). Let IΛ be a group code in Fq[G]. Its length n is the order of G in group algebra Fq[G]. Its dimension k is the dimension of IΛ as a subspace over Fq. Its minimal distance d is defined as d=min{wt(α):αei=0 for nonzero element α and for all eiΛ}. Thus the group code IΛ is called an [n,k,d] code. Moreover, a linear [n,k,d] group code over Fq with d=nk+1 is called a maximum distance separable (MDS) group code. And, a linear [n,k,d] group code over Fq with d=nk is called an almost MDS (AMDS) group code. MDS codes and AMDS codes are considered to be an attractive solution for information storage as they operate at the optimal storage versus reliability trade-off (see [8,15,17,18,20,21]).

    Based on the following lemma, we can give the unique idempotents of Fq[G].

    Lemma 2.2. [10] If χ is a character of FqG-module, then the idempotents corresponding to the character χ are given by

    e=1|G|gGχ(g1)g.

    In the subsection, we will consider the group codes on S3, where S3 is a nonabelian group with the smallest order. Let

    S3=a,b:a3=b2=(ab)2=1={1,a,a2,b,ab,a2b}.

    It is well-known that S3 is all the permutations on three elements 1, 2, 3. In this sense, set a=(123),b=(12), S3 can be given by {(1),(123),(132),(12),(23),(13)}. For convenience, we denote gi(1i6) as the i-th element of S3 in the above two sets.

    In addition, S3 has three conjugacy classes as follows:

    C1={1},C2={b,ab,a2b},C3={a,a2}.

    Since the commutator group of S3 is S3={1,a,a2}, we have |S3/S3|=2. As a consequence of this, the group S3 has two linear characters χ1,χ2 and one nonlinear character χ3. The character table of S3 is as follows (see Table 1).

    Table 1.  The character table of S3.
    Characters 1 a b
    χ1 1 1 1
    χ2 1 -1 1
    χ3 2 0 -1

     | Show Table
    DownLoad: CSV

    By Lemma 2.2, the unique idempotents of FqS3 are given in the following theorem.

    Theorem 3.1. There are three idempotents in FqS3 as follows:

    e1=16[1+¯C2+¯C3],e2=16[1¯C2+¯C3],f1=16[2¯C3],

    where ¯Ci=gCig,i=2,3.

    In order to construct the group codes of FqS3, we need the product between idempotents e1,e2,f1 and an arbitrary element of FqS3. For any element α=6i=1aigiFqS3, where aiFq,i=1,2,,6, we have

    αe1=(6i=1ai)e1. (3.1)
    αe2=(3i=1ai6i=4ai)e2. (3.2)
    αf1=16[(2a1a2a3)g1+(a1+2a2a3)g2+(a1a2+2a3)g3+(2a4a5a6)g4+(a4+2a5a6)g5+(a4a5+2a6)g6]. (3.3)

    The following theorems give us the parameters of group codes in FqS3.

    Theorem 3.2. Let e1,e2 and f1 be idempotents in FqS3. Then

    (1) I{e1} is a [6,5,2] group code;

    (2) I{e2} is a [6,5,2] group code;

    (3) I{f1} is a [6,5,3] group code.

    Proof. (1) Clearly, I{e1}={αFqS3|αe1=0}. Firstly, we will give the dimension of group code I{e1}. For any α=6i=1aigiI{e1}, we have αe1=0. By (3.1), we obtain 6i=1ai=0. Then dim(I{e1})=5. Secondly, we will compute the minimal distance of group code I{e1}. For some α=kgi,1i6, if k0, then αe10, i.e., α=kgiI{e1}. So d(I{e1})2. Set α=g1g2. Since αe1=(g1g2)e1=0, we get α=g1g2I{e1}. Hence, d(I{e1})=2.

    (2) Clearly, I{e2}={αFqS3|αe2=0}. Firstly, we will give the dimension of group code I{e2}. For any α=6i=1aigiI{e2}, we have αe2=0. By (3.2), we obtain 3i=1ai6i=4ai=0. Then dim(I{e2})=5. Secondly, we will compute the minimal distance of group code I{e2}. For some α=kgi,1i6, if k0, then αe20, i.e., α=kgiI{e2}. So d(I{e2})2. Set α=g1+g4. Since αe2=(g1+g4)e2=0, we get α=g1+g4I{e2}. Hence, d(I{e2})=2.

    (3) Clearly, I{f1}={αFqS3|αf1=0}. Firstly, we will give the dimension of group code I{f1}. For any α=6i=1aigiI{f1}, we have αf1=0. By (3.3), we obtain

    {2a1a2a3=0a1+2a2a3=0a1a2+2a3=02a4a5a6=0a4+2a5a6=0a4a5+2a6=0.

    Since the rank of the coefficient matrix of the above equation is 4, we know that dim(I{f1})=2. Secondly, we will compute the minimal distance of group code I{f1}. For some α=kigi+kjgj,1i,j6, if ki,kj0, then αf10, i.e., α=kigi+kjgjI{f1}. So d(I{f1})3. Set α=g1+g2+g3. Since αf1=(g1+g2+g3)f1=0, we get α=g1+g2+g3I{f1}. Hence, d(I{f1})=3.

    This completes the proof.

    Theorem 3.3. Let e1,e2 and f1 be idempotents in FqS3. Then

    (1) I{e1,e2} is a [6,4,2] group code;

    (2) I{e1,f1} is a [6,1,6] group code;

    (3) I{e2,f1} is a [6,1,6] group code.

    Proof. (1) Clearly, I{e1,e2}={αFqS3|αe1=0,αe2=0}. Firstly, we will give the dimension of group code I{e1,e2}. For any α=6i=1aigiI{e1,e2}, we have αe1=0 and αe2=0. From (3.1) and (3.2), we obtain

    {a1+a2+a3+a4+a5+a6=0a1+a2+a3a4a5a6=0.

    Since the rank of the coefficient matrix of the above equation is 2, we know that dim(I{e1,e2})=4. Secondly, we will compute the minimal distance of group code I{e1,e2}. For some α=kgi,1i6, if k0, then αe10, i.e., α=kgiI{e1,e2}. So d(I{e1,e2})2. Set α=g1g3. Since αe1=(g1g3)e1=0 and αe2=(g1g3)e2=0, we get α=g1g3I{e1,e2}. Hence, d(I{e1,e2})=2.

    (2) Clearly, I{e1,f1}={αFqS3|αe1=0,αf1=0}. Firstly, we will give the dimension of group code I{e1,f1}. For any α=6i=1aigiI{e1,f1}, we have αe1=0 and αf1=0. From (3.1) and (3.3), we obtain

    {a1+a2+a3+a4+a5+a6=02a1a2a3=0a1+2a2a3=0a1a2+2a3=02a4a5a6=0a4+2a5a6=0a4a5+2a6=0.

    Since the rank of the coefficient matrix of the above equations is 5, we know that dim(I{e1,f1})=1. Secondly, we will compute the minimal distance of group code I{e1,f1}. If we take α=g1+g2+g3, we have αf1=0 and αe10, i.e., α=g1+g2+g3I{e1,f1}. So d(I{e1,e2})3. Set α=g1+g2+g3g4g5g6. Since αe1=(g1+g2+g3g4g5g6)e1=0 and αe2=(g1+g2+g3g4g5g6)f1=0, we get α=g1+g2+g3g4g5g6I{e1,f1}. Hence, d(I{e1,f1})=6.

    (3) The result can be obtained by a similar proof of (2).

    This completes the proof. We can get the following results based on Theorems 3.2 and 3.3.

    Remark 3.4. Let e1,e2 and f1 be idempotents in FqS3.

    (1) I{ei},I{ei,f1},i=1,2 are MDS group codes;

    (2) I{e1,e2} is an AMDS group codes.

    In the subsection, we will consider the group codes on S4, where S4 is a nonabelian group of order 24. Let

    S4=a,b:a4=b2=(ab)4=1={1,a,a2,a3,b,ab,a2b,a3b,ba,aba,a2ba,a3ba,ba2,aba2,a2ba2,a3ba2,ba3,aba3,a2ba3,a3ba3,ba2b,aba2b,a2ba2b,a3ba2b}.

    It is well-known that S4 is all the permutations on four elements 1, 2, 3, 4. In this sense, set a=(1234),b=(12), S4 can be given by {(1), (1234), (13)(24), (1432), (12), (234), (1324), (143), (134), (1243), (142), (23), (1423), (132), (34), (124), (243), (14), (123), (1342), (14)(23), (13), (12)(34), (24)}. For convenience, we denote gi (1i24) as the i-th element of S4 in the above two sets.

    In addition, S4 has five conjugacy classes as follows:

    C1={(1)},C2={(12),(13),(14),(23),(24),(34)},C3={(12)(34),(13)(24),(14)(23)},C4={(123),(132),(234),(243),(124),(142),(134),(143)},C5={(1234),(1432),(1324),(1243),(1423),(1342)}.

    Since the commutator group of S4 is S4=A4, we have |S4/S4|=2. As a consequence of this, the group S4 has two linear characters χ1,χ2 and three nonlinear characters χ3, χ4, χ5. The character table of S4 is as follows (see Table 2).

    Table 2.  The character table of S4.
    Characters (1) (12) (12)(34) (123) (1234)
    χ1 1 1 1 1 1
    χ2 1 -1 1 1 -1
    χ3 2 0 2 -1 0
    χ4 3 1 -1 0 -1
    χ5 3 -1 -1 0 1

     | Show Table
    DownLoad: CSV

    By Lemma 2.2, the unique idempotents of FqS4 are given in the following theorem.

    Theorem 3.5. There are five idempotents in FqS4 as follows:

    e1=124[1+¯C2+¯C3+¯C4+¯C5],e2=124[1¯C2+¯C3+¯C4¯C5],f1=124[2+2¯C3¯C4],f2=124[3+¯C2¯C3¯C5],f3=124[3¯C2¯C3+¯C5],

    where ¯Ci=gCig,i=2,3,4,5.

    In order to construct the group codes of FqS4, we need the product between idempotents e1,e2,f1,f2,f3 and an arbitrary element of FqS4. For any element α=24i=1aigiFqS4, where aiFq,i=1,2,,24, we have

    αe1=(24i=1ai)e1. (3.4)
    αe2=[(a1+a3+a6+a8+a9+a11+a14+a17+a17+a19+a21+a23)(a2+a4+a5+a7+a10+a12+a13+a15+a18+a20+a22+a24)]e2. (3.5)

    αf1=124[(2a1+2a3+2a21+2a23a6a8a9a11a14a16a17a19)(g1+g3+g21+g23)+(2a2+2a4+2a22+2a24a5-a7a10a12a13a15a18a20)(g2+g4+g22+g24)+(2a5+2a7+2a13+2a15-a2a4a10a12a18a20a22a24)(g5+g7+g13+g15)+(2a6+2a8+2a14+2a16a1a3a9a11a17a19a21a23)(g6+g8+g14+g16)+(2a9+2a11+2a17+2a19a1a3-a6a8a14a16a21a23)(g9+g11+g17+g19)+(2a10+2a12+2a18+2a20a2a4a5a7a13a15a22a24)(g10+g12+g18+g20).

    αf2=124[(3a1+a5+a12+a15+a18+a22+a24a3a21a23a2a4a7a10a13a20)g1+(3a2+a6+a9+a16+a19+a21+a23-a4a22a24a1a3a8a11a14a17)g2+(3a3+a7+a10+a13+a20+a22+a24a1a21-a23a2a4a5a12a15a18)g3+(3a4+a8+a11+a14+a17+a21+a23a2a22-a24a1a3a6a9a16a19)g4+(3a5+a1+a11+a14+a16+a19+a23-a7a13a15a2a6a8a9a17a21)g5+(3a6+a2+a12+a13+a15+a20+a24a8a14-a16a3a5a7a10a18a22)g6+(3a7+a3+a9+a14+a16+a17+a21a5a13a15a1a6a8a11a19a23)g7+(3a8+a4+a10+a13+a15+a18+a22a6-a14a16a2a5a7a12a20a24)g8+(3a9+a2+a7+a15+a18+a20+a22a11a17a19a4a5a10a12a13a24)g9+(3a10+a3+a8+a16+a17+a19+a23a12-a18a20a1a6a9a11a14a21)g10+(3a11+a4+a5+a13+a18+a20+a24a9a17a19a2a7a10a12a15a22)g11+(3a12+a1+a6+a14+a17+a19+a21a10a18a20a3a8a9a11a16a23)g12+(3a13+a3+a6+a8+a11+a19+a21a5a7a15a1a9a14a16a17a23)g13+(3a14+a4+a5+a7+a12+a20+a22a6a8a16-a2a10a13a15a18a24)g14+(3a15+a1+a6+a8+a9+a17+a23a5a7a13a3a11a14a16a19a21)g15+(3a16+a2+a5+a7+a10+a18+a24a6a8a14-a4a12a13a15a20a22)g16+(3a17+a4+a7+a10+a12+a15+a24a9a11a19a2a5a13a18a20a22)g17+(3a18+a1+a8+a9+a11+a16+a21a10a12a20a3a6a14a17a19a23)g18+(3a19+a2+a5+a10+a12+a13+a22-a9a11-a17a4a7a15a18a20a24)g19+(3a20+a3+a6+a9+a11+a14+a23a10a12a18a1a8a16a17a19a21)g20+(3a21+a2+a4+a7+a12+a13+a18a1a3a23a5-a10a15a20a22a24)g21+(3a22+a1+a3+a8+a9+a14+a19a2a4a24a6a11a16a17a21a23)g22+(3a23+a2+a4+a5+a10+a15+a20a1a3a21a7a12a13a18a22a24)g23+(3a24+a1+a3+a6+a11+a16+a17a2a4a22a8a9a14a19a21a23)g24].

    αf3=124[(3a1a3a5a12a15a18a21a22a23a24+a2+a4+a7+a10+a13+a20)g1+(3a2a4a6a9a16a19a21a22a23a24+a1+a3+a8+a11+a14+a17)g2+(3a3a1a7a10a13a20-a21a22a23a24+a2+a4+a5+a12+a15+a18)g3+(3a4a2a8a11a14a17a21-a22a23a24+a1+a3+a6+a9+a16+a19)g4+(3a5a1a7a11a13a14-a15a16a19a23+a2+a6+a8+a9+a17+a21)g5+(3a6a2a8a12a13a14a15a16-a20a24+a3+a5+a7+a10+a18+a22)g6+(3a7a3a5a9a13a14a15-a16a17a21+a1+a6+a8+a11+a19+a23)g7+(3a8a4a6a10a13a14a15a16a18a22+a2+a5+a7+a12+a20+a24)g8+(3a9a2a7-a11a15a17a18-a19a20a22+a4+a5+a10+a12+a13+a24)g9+(3a10a3a8a12a16a17a18a19a20a23+a1+a6+a9+a11+a14+a21)g10+(3a11a4a5a9a13a17a18a19-a20a24+a2+a7+a10+a12+a15+a22)g11+(3a12a1a6a10a14a17a18a19a20a21+a3+a8+a9+a11+a16+a23)g12+(3a13a3a5a6-a7a8a11a15a19a21+a1+a9+a14+a16+a17+a23)g13+(3a14a4a5a6a7a8a12a16a20a22+a2+a10+a13+a15+a18+a24)g14+(3a15a1a5a6a7a8a9-a13a17a23+a3+a11+a14+a16+a19+a21)g15+(3a16a2a5a6a7a8a10a14a18a24+a4+a12+a13+a15+a20+a22)g16+(3a17a4a7a9a10-a11a12a15a19a24+a2+a5+a13+a18+a20+a22)g17+(3a18a1a8a9a10a11a12a16a20a21+a3+a6+a14+a17+a19+a23)g18+(3a19a2a5a9-a10a11a12-a13a17a22+a4+a7+a15+a18+a20+a24)g19+(3a20a3a6a9a10a11a12a14a18a23+a1+a8+a16+a17+a19+a21)g20+(3a21a1a2-a3a4a7a12a13a18a23+a5+a10+a15+a20+a22+a24)g21+(3a22a1a2a3a4a8-a9a14a19a24+a6+a11+a16+a17+a21+a23)g22+(3a23a1a2a3a4a5a10a15-a20a21+a7+a12+a13+a18+a22+a24)g23+(3a24a1a2a3a4a6a11a16a17a22+a8+a9+a14+a19+a21+a23)g24].

    The following theorems give us the parameters of group codes in FqS4.

    Theorem 3.6. Let ei,i=1,2 and fj,j=1,2,3 be idempotents in FqS4. Then

    (1) I{ei} is a [24,23,2] group code, for i=1,2;

    (2) I{f1} is a [24,20,2] group code;

    (3) I{fj} is a [24,15,4] group code, for j=2,3.

    Proof. (1) Clearly, I{ei}={αFqS4|αei=0}, for i=1,2. Firstly, we will give the dimension of group code I{ei},i=1,2. For any α=24i=1aigiI{ei}, we have αei=0. By (3.4), we obtain the following equation:

    24i=1ai=0. (3.6)

    By (3.5), we obtain the following equation:

    (a1+a3+a6+a8+a9+a11+a14+a17+a17+a19+a21+a23)(a2+a4+a5+a7+a10+a12+a13+a15+a18+a20+a22+a24)=0. (3.7)

    Then, for i=1,2, we have dim(I{ei})=5. Secondly, we will compute the minimal distance of group code I{ei}. For some α=kgi,1i24, if k0, then αei0, i.e., α=kgiI{ei}. So d(I{ei})2. Set α=g1g3. Since αei=(g1g3)ei=0, we get α=g1g3I{ei}. Hence, d(I{ei})=2.

    (2) Clearly, I{f1}={αFqS4|αf1=0}. Firstly, we will give the dimension of group code I{f1}. For any α=24i=1aigiI{f1}, we have αf1=0. Then, we obtain the following equations:

    2a1+2a3+2a21+2a23a6a8a9a11a14a16a17a19=0. (3.8)
    2a2+2a4+2a22+2a24a5a7a10a12a13a15a18a20=0. (3.9)
    2a5+2a7+2a13+2a15a2a4a10a12a18a20a22a24=0. (3.10)
    2a6+2a8+2a14+2a16a1a3a9a11a17a19a21a23=0. (3.11)
    2a9+2a11+2a17+2a19a1a3a6a8a14a16a21a23=0. (3.12)
    2a10+2a12+2a18+2a20a2a4a5a7a13a15a22a24=0. (3.13)

    Since the rank of the coefficient matrix of the above equations is 4, we know that dim(I{f1})=20. Secondly, we will compute the minimal distance of group code I{f1}. For some α=kgi,1i24, if k0, then αf10, i.e., α=kgiI{f1}. So d(I{f1})2. Set α=g2g4. Since αf1=(g2g4)f1=0, we get α=g2g4I{f1}. Hence, d(I{f1})=2.

    (3) Clearly, I{fi}={αFqS4|αfi=0},i=2,3. Firstly, we will give the dimension of group code I{f2}. For any α=24i=1aigiI{f2}, we have αf2=0. Then, we obtain a corresponding system of equations:

    3a1+a5+a12+a15+a18+a22+a24a3a21a23a2a4a7a10a13a20=0. (3.14)
    3a2+a6+a9+a16+a19+a21+a23a4a22a24a1a3a8a11a14a17=0. (3.15)
    3a3+a7+a10+a13+a20+a22+a24a1a21a23a2a4a5a12a15a18=0. (3.16)
    3a4+a8+a11+a14+a17+a21+a23a2a22a24a1a3a6a9a16a19=0. (3.17)
    3a5+a1+a11+a14+a16+a19+a23a7a13a15a2a6a8a9a17a21=0. (3.18)
    3a6+a2+a12+a13+a15+a20+a24a8a14a16a3a5a7a10a18a22=0. (3.19)
    3a7+a3+a9+a14+a16+a17+a21a5a13a15a1a6a8a11a19a23=0. (3.20)
    3a8+a4+a10+a13+a15+a18+a22a6a14a16a2a5a7a12a20a24=0. (3.21)
    3a9a2a7a11a15a17a18a19a20a22+a4+a5+a10+a12+a13+a24=0. (3.22)
    3a10+a3+a8+a16+a17+a19+a23a12a18a20a1a6a9a11a14a21=0. (3.23)
    3a11a4a5a9a13a17a18a19a20a24+a2+a7+a10+a12+a15+a22=0. (3.24)
    3a12a1a6a10a14a17a18a19a20a21+a3+a8+a9+a11+a16+a23=0. (3.25)
    3a13+a3+a6+a8+a11+a19+a21a5a7a15a1a9a14a16a17a23=0. (3.26)
    3a14+a4+a5+a7+a12+a20+a22a6a8a16a2a10a13a15a18a24=0. (3.27)
    3a15+a1+a6+a8+a9+a17+a23a5a7a13a3a11a14a16a19a21=0. (3.28)
    3a16+a2+a5+a7+a10+a18+a24a6a8a14a4a12a13a15a20a22=0. (3.29)
    3a17+a4+a7+a10+a12+a15+a24a9a11a19a2a5a13a18a20a22=0. (3.30)
    3a18+a1+a8+a9+a11+a16+a21a10a12a20a3a6a14a17a19a23=0. (3.31)
    3a19+a2+a5+a10+a12+a13+a22a9a11a17a4a7a15a18a20a24=0. (3.32)
    3a20+a3+a6+a9+a11+a14+a23a10a12a18a1a8a16a17a19a21=0. (3.33)
    3a21+a2+a4+a7+a12+a13+a18a1a3a23a5a10a15a20a22a24=0. (3.34)
    3a22+a1+a3+a8+a9+a14+a19a2a4a24a6a11a16a17a21a23=0. (3.35)
    3a23+a2+a4+a5+a10+a15+a20a1a3a21a7a12a13a18a22a24=0. (3.36)
    3a24+a1+a3+a6+a11+a16+a17a2a4a22a8a9a14a19a21a23=0. (3.37)

    Since the rank of the coefficient matrix of the above equations is 9, we know that dim(I{f2})=15. Secondly, we will compute the minimal distance of group code I{f2}. For some α=kgi,1i24, if k0, then αf20, i.e., α=kgiI{f2}. Though the coefficients of f2, it is not difficult to find that αf20 for wt(α)3. So d(I{f2})4. Set α=g1+g2+g3+g4. Since αf1=(g1+g2+g3+g4)f1=0, we get α=g1+g2+g3+g4I{f2}. Hence, d(I{f2})=4. We can compute the parameters of group code I{f2} by the similarly method (for d(I{f3})=4, take α=g1+g2g3+g4).

    This completes the proof.

    Theorem 3.7. Let ei,i=1,2 and fj,j=1,2,3 be idempotents in FqS4. Then

    (1) I{e1,e2} is a [24,22,2] group code;

    (2) I{ei,f1} is a [24,17,2] group code, for i=1,2;

    (3) I{ei,fj} is a [24,14,8] group code, for i=1,2,j=2,3;

    (4) I{f1,fj} is a [24,11,8] group code, for j=2,3;

    (5) I{f2,f3} is a [24,6,8] group code.

    Proof. (1) Clearly, I{e1,e2}={αFqS4|αe1=0 and αe2=0}. Firstly, we will give the dimension of group code I{e1,e2}. For any α=24i=1aigiI{e1,e2}, we have αe1=0 and αe2=0. From (3.4) and (3.5), we obtain the following system of equations: {24i=1ai=0(a1+a3+a6+a8+a9+a11+a14+a17+a17+a19+a21+a23)(a2+a4+a5+a7+a10+a12+a13+a15+a18+a20+a22+a24)=0.

    Then, we have dim(I{e1,e2})=22. Secondly, we will compute the minimal distance of group code I{e1,e2}. For some α=kgi,1i24, if k0, then αei0, i.e., α=kgiI{e1,e2}. So d(I{e1,e2})2. Set α=g1g3. Since αei=(g1g3)ei=0, for i=1,2, we get α=g1g3I{e1,e2}. Hence, d(I{e1,e2})=2.

    (2) Let I{ei,f1},i=1,2 be the set of elements of the form α=24i=1aigi which the coefficients of α satisfy Eqs (3.6) and (3.8)–(3.13) for i=1, while Eqs (3.7)–(3.13) for i=2. Obviously, it does not contain any element with weight 1 of I{ei,f1},i=1,2. Also, set α=g1g3, then αI{ei,f1},i=1,2. Hence, d(I{ei,f1})=2,i=1,2. Moreover, the dimension of I{ei,f2},i=1,2 is 17. Therefore, I{ei,f1},i=1,2 is a [2,17,24] group code.

    (3) Let I{ei,f2},i=1,2 be the set of elements of the form α=24i=1aigi which the coefficients of α satisfy Eqs (3.6) and (3.14)–(3.37) for i=1, while Eqs (3.7) and (3.14)–(3.37) for i=2. Obviously, it does not contain any element with weight 4 of I{ei,f2},i=1,2. Also, set α=g1+g2+g3+g4g5g6g7g8, then αI{ei,f2},i=1,2. Hence, d(I{ei,f2})=8,i=1,2. Moreover, the dimension of I{ei,f2},i=1,2 is 14. Therefore, I{ei,f2},i=1,2 is a [8,14,24] group code. In addition, we can obtain the parameters of I{ei,f3},i=1,2 by a similar proof.

    (4) Let I{f1,f2} be the set of elements of the form α=24i=1aigi which the coefficients of α satisfy Eqs (3.8)–(3.37). Obviously, it does not contain any element with weight 4 of I{f1,f2}. Also, set α=g1+g2+g3+g4g21g22g23g24, then αI{f1,f2}. Hence, d(I{f1,f2})=8. Moreover, the dimension of I{f1,f2} is 11. Therefore, I{f1,f2} is a [24,11,8] group code. In addition, we can obtain the parameters of I{f1,f3} by a similar proof.

    (5) Let I{f2,f3} be the set of elements of the form α=24i=1aigi which the coefficients of α satisfy the corresponding equations. Obviously, it does not contain any element with weight 4 of I{f2,f3}. Also, set α=g1+g2+g3+g4g21g22g23g24, then αI{f2,f3}. Hence, d(I{f2,f3})=8. Moreover, the dimension of I{f2,f3} is 6. Therefore, I{f2,f3} is a [6,8,24] group code.

    This completes the proof.

    We summarize the following results about the group codes of FqS4. In fact, these results can be proved by using similar techniques with rigorous derivation that we have used in the previous results in this section.

    Theorem 3.8. Let ei,i=1,2 and fj,j=1,2,3 be idempotents in FqS4. Then

    (1) I{e1,e2,f1} is a [24,18,2] group code;

    (2) I{e1,e2,fj} is a [24,13,8] group code, for j=2,3;

    (3) I{ei,f1,fj} is a [24,10,8] group code, for i=1,2,j=2,3;

    (4) I{ei,f2,f3} is a [24,5,8] group code, for i=1,2;

    (5) I{f1,f2,f3} is a [24,2,8] group code, for i=1,2.

    Theorem 3.9. Let ei,i=1,2 and fj,j=1,2,3 be idempotents in FqS4. Then

    (1) I{ei,f1,f2,f3} is a [24,1,8] group code, for i=1,2;

    (2) I{e1,e2,f1,fj} is a [24,9,8] group code, for j=2,3;

    (3) I{e1,e2,f2,f3} is a [24,4,8] group code.

    We can obtain the following results based on Theorems 3.6–3.9.

    Remark 3.10. Let ei,i=1,2 and fj,j=1,2,3 be idempotents in FqS4.

    (1) I{ei},i=1,2, and I{e1,e2} are MDS group codes.

    (2) There are no AMDS group codes in FqS4.

    The main contributions of this paper are the following:

    The unique (linear and nonlinear) idempotents of FqS3 and FqS4 were described (see Theorems 3.1 and 3.6).

    The minimum distances and dimensions of FqS3 and FqS4 were characterized (see Theorems 3.2–3.3 and 3.6–3.9).

    The MDS group codes and almost MDS group codes in FqS3 and FqS4 were constructed (see Remarks 3.4 and 3.10).

    The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

    The authors are very grateful to the reviewers and the Associate Editor for their valuable comments and suggestions to improve the quality of this paper.

    The paper is supported by National Natural Science Foundation of China (Nos. 11961050, 12101277), Fundation of Nanjing Institute of Technology (No. CKJB202007), the Guangxi Natural Science Foundation(No. 2020GXNSFAA159053).

    The authors declare that there is no conflict of interest regarding the publication of this paper.



    [1] A. Boripan, S. Jitman, P. Udomkavanich, Characterization and enumeration of complementary dual abelian codes, J. Appl. Math. Comput., 58 (2018), 527–544. https://doi.org/10.1007/s12190-017-1155-7 doi: 10.1007/s12190-017-1155-7
    [2] F. E. B. Martínez, Structure of finite dihedral group algebra, Finite Fields Appl., 35 (2015), 204–214. https://doi.org/10.1016/j.ffa.2015.05.002 doi: 10.1016/j.ffa.2015.05.002
    [3] Y. Cao, Y. Cao, F. Fu, Concatenated structure of left dihedral codes, Finite Fields Appl., 38 (2016), 93–115. https://doi.org/10.1016/j.ffa.2016.01.001 doi: 10.1016/j.ffa.2016.01.001
    [4] Y. Cao, Y. Cao, F. Fu, S. Wang, Left dihedral codes over Galois ring GR(p2,m), Discrete Math., 341 (2018), 1816–1834. https://doi.org/10.13140/RG.2.2.34951.19365 doi: 10.13140/RG.2.2.34951.19365
    [5] P. Choosuwan, S. Jitman, P. Udomkavanich, Self-dual abelian codes in some nonprincipal ideal group algebras, Math. Probl. Eng., 2016 (2016), 9020173. https://doi.org/10.1155/2016/9020173 doi: 10.1155/2016/9020173
    [6] Y. Gao, Q. Yue, Idempotents of generalized quaternion group algebras and their applications, Discret. Math., 344 (2021), 112342. https://doi.org/10.1016/j.disc.2021.112342 doi: 10.1016/j.disc.2021.112342
    [7] Y. Gao, Q. Yue, Y. Wu, LCD codes and self-orthogonal codes in generalized dihedral group algebras, Des. Codes Cryptogr., 88 (2020), 2275–2287. https://doi.org/10.1007/s10623-020-00778-z doi: 10.1007/s10623-020-00778-z
    [8] Z. Heng, C. Ding, The subfield codes of some [q+1,2,q] MDS codes, IEEE Trans. Inf. Theory, 68 (2022), 3643–3656. https://doi.org/10.1109/TIT.2022.3163813 doi: 10.1109/TIT.2022.3163813
    [9] I. M. Isaacs, Algebra, a graduate course, Pacific Grove, California: Cole Publishing, 1992. http://dx.doi.org/10.1090/gsm/100
    [10] G. D. James, M. W. Liebeck, Representation and characters of groups, California: Cole Publishing, Pacific Grove, 1992. http://dx.doi.org/10.1063/1.2808641
    [11] S. Jitman, S. Ling, H. Liu, X. Xie, Abelian codes in principal ideal group algebras, IEEE Trans. Inf. Theory, 59 (2013), 3046–3057. https://doi.org/10.1109/TIT.2012.2236383 doi: 10.1109/TIT.2012.2236383
    [12] F. E. B. Martínez, C. R. G. Vergara, Explicit idempotents of finite group algebras, Finite Fields Appl., 28 (2014), 123–131. https://doi.org/10.1016/j.ffa.2015.05.002 doi: 10.1016/j.ffa.2015.05.002
    [13] C. P. Milies, F. D. de Melo, On cyclic and abelian codes, IEEE Trans. Inf. Theory, 59 (2013), 7314–7319. https://doi.org/10.1109/TIT.2013.2275111 doi: 10.1109/TIT.2013.2275111
    [14] C. P. Milies, S. K. Sehgal, An introduction to group rings, Pacific Grove, California: Cole Publishing, 1992. http://dx.doi.org/10.1007/978-94-010-0405-3_2
    [15] Y. Niu, Q. Yue, Y. Wu, L. Hu, Hermitian self-dual, MDS, and generalized Reed-Solomon codes, IEEE Commun. Lett., 23 (2019), 781–784. https://doi.org/10.1109/LCOMM.2019.2908640 doi: 10.1109/LCOMM.2019.2908640
    [16] D. S. Passman, The algebraic structure of group rings, New York, Wiley, 1977.
    [17] J. Sui, Q. Yue, X. Li, D. Huang, MDS, near-MDS or 2-MDS self-dual codes via twisted generalized Reed-Solomon codes, IEEE Trans. Inf. Theory, 68 (2022), 7832–7841. https://doi.org/10.1109/TIT.2022.3190676 doi: 10.1109/TIT.2022.3190676
    [18] C. Tang, Q. Wang, C. Ding, The subfield codes and subfield subcodes of a family of MDS codes, IEEE Trans. Inf. Theory, 68 (2022), 5792–5801. https://doi.org/10.1109/TIT.2022.3163813 doi: 10.1109/TIT.2022.3163813
    [19] J. H. van Lint, Introduction to coding theory, New York Heidelberg, Berlin: Springer-Verlag, 1982.
    [20] Y. Wu, J. Y. Hyun, Y. Lee, New LCD MDS codes of non-Reed-Solomon type, IEEE Trans. Inf. Theory, 67 (2021), 5069–5078. https://doi.org/10.1109/TIT.2021.3086818 doi: 10.1109/TIT.2021.3086818
    [21] G. Xu, X. Cao, L. Qu, Infinite families of 3-designs and 2-designs from almost MDS codes, IEEE Trans. Inf. Theory, 68 (2022), 4344–4353. https://doi.org/10.1109/TIT.2022.3157199 doi: 10.1109/TIT.2022.3157199
  • Reader Comments
  • © 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1466) PDF downloads(180) Cited by(0)

Figures and Tables

Tables(2)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog