On Linear Codes over Finite Singleton Local Rings

: The study of linear codes over local rings, particularly non-chain rings, imposes difficulties that differ from those encountered in codes over chain rings, and this stems from the fact that local non-chain rings are not principal ideal rings. In this paper, we present and successfully establish a new approach for linear codes of any finite length over local rings that are not necessarily chains. The main focus of this study is to produce generating characters, MacWilliams identities and generator matrices for codes over singleton local Frobenius rings of order 32. To do so, we first start by characterizing all singleton local rings of order 32 up to isomorphism. These rings happen to have strong connections to linear binary codes and Z 4 codes, which play a significant role in coding theory.


Introduction
All rings considered in this article are finite commutative and have an identity.A ring R is defined to be local if it has a unique maximal ideal, denoted J(R) or simply J, called the Jacobson radical.Furthermore, it is well established that all finite commutative Frobenius rings can be decomposed as a product of local Frobenius rings.Thus, studying codes over local rings is essential, as most structural coding theory findings have been transferred to such rings.The idea that the class of Frobenius rings is the appropriate class to describe codes is well known, and this is largely due to the fulfilment of both MacWilliams theorems.For more details on the theory of rings, we refer to [1][2][3][4] and the references therein.
Linear codes of length N over R correspond to subsets of R N which are R-submodules of R. When N is divisible by the characteristic of the residue field R/J, then these codes are called repeated-root codes; otherwise, they are simple codes.Using Gray maps, linear codes over fields were related to those over chain rings.While codes over chain rings have been extensively investigated, codes over local non-chain rings have not gained as much attention.The main reason for this disparity is because chain rings are principle ideal rings (PIRs), and as PIRs are characterized as direct sums of chain rings, many conclusions on chain rings may also be applied to PIRs.However, to fully determine codes over Frobenius rings, it is essential to consider local rings which are not chains, even though this imposes challenges, since the rings are not PIRs.We recommend references [5][6][7][8][9][10][11][12][13][14][15] to readers.
This paper mainly concentrates on determining fundamental coding results over local Frobenius rings, with a specific focus on rings of order 32, to clarify the significance of general results.The study of singleton local rings was accomplished in [2], and their relevance in coding theory was demonstrated through connections to linear binary and Z 4 codes, see [16].We proceed to investigate, in this article, two crucial tools in coding theory: MacWilliams relations and generator matrices.In [17], the authors discussed these tools over local Frobenius rings with small order, i.e., 16, based on the classification of local Frobenius rings with order 16 provided in [18].Thus, we aim to concentrate on rings of order 32 and utilize them as examples.First, we present a constructive approach to finding a generating character χ associated with any singleton local Frobenius ring with invariants p, n, r, t.Given such an χ, determining the MacWilliams relations when working with rings of order 32 becomes straightforward.
On the other hand, generator matrices are highly advantageous for linear codes because they not only generate the code but also make it easier to compute the code size.Chain rings have a well-established standard form that satisfies this purpose, but this however cannot be said for codes with alphabets of local (non-chain) rings.In this regard, we introduce a natural generalization to local non-chain Frobenius rings whose orders are 32.We also demonstrate, through several numerical examples, why such a generator matrix does not necessarily result in determining the code size.
Following the preliminary definitions and results presented in Section 2, the classification of singleton local Frobenius rings with invariants p, n, r, t is described in Section 3, with special attention to giving the full details of characterizing rings of order 32.The method for finding, in general, generating characters for singleton Frobenius rings is given in Section 4. Additionally, specific generating characters are determined for all singleton local Frobenius rings of order 32.Subsequently, the matrix associated with the weight enumerator is obtained.Section 5 focuses on the results concerning generator matrices for linear codes over such rings of order 32.

Preliminaries
Throughout this section, we introduce some notations and basic facts which will be utilized later in our discussion.From now on, suppose that R is a finite commutative singleton local ring with identity, and J denotes its Jacobson radical.We will rely on the following wellestablished results from the theory of finite rings and coding theory (see [2,3,6,8,15,19]).
First, we define Jacobson radical J of R as the maximal ideal of R. The order of R, is |R| = p mr , where p is a prime number, and that of J is p (m−1)r under the condition J m = 0.The additive order of 1 in R (characteristic) is of the form p n , such that 1 ≤ n ≤ m and R/J ∼ = GF(p r ) = F.Moreover, R has a coefficient subring S of the form GR(p n , r), known as the maximal Galois subring of R. It has been shown that there exists π in J such that R = S + Sπ, J = pS + πS. ( A chain ring is a ring for which its J is principal.When m = n, then R is commutative, and J is generated by the element p.Moreover, R can be constructed over Z p n as a Galois extension, where a has a multiplicative order of p r − 1 and g(x) is a monic basic polynomial (irreducible modulo p) of degree r over Z p n .Elements of R can be uniquely expressed (p-adic expression) as a sum of terms involving Suppose t is the additive order of π; p t π = 0. We characterize the integers p, n, r and t as the invarints of R. The group of units of R, U(R), is decomposed as where H = 1 + J is called the one group.We define the socle of R, soc(R), as the sum of all minimal ideals of R. As the rings under consideration are commutative rings, then the socle coincides with the annihilator of J.In the literature, there are several equivalent definitions of Frobenius rings.However, in our discussion, we will focus on a specific definition that is most relevant to our subsequent analysis.Definition 1 ([4]).We call R a Frobenius ring if soc(R) ∼ = R/J, considered as F-vector spaces.
Finite Frobenius rings have a very simple charaterization due to the work in [1].A character χ of (R, +) is an element of Hom Z (R, C * ), the character group of (R, +).We call χ a generating character if kerχ contains no left ideals of R which are not trivial.
Theorem 1 (Wood [1]).A finite ring R is a Frobenius ring if and only if it has a generating character χ ∈ Hom Z (R, C * ).

Corollary 1 ([1]
).A finite ring R is a Frobenius ring if and only if it has a unique minimal ideal.
Theorem 2 (Honold [4]).A finite ring R is a Frobenius ring if and only if its soc(R) is cyclic.
A subset of R N is called a code C of length N over R, and if C is a submodule, then it is called a linear code.Furthermore, we can incorporate the inner-product in R N , and thus we can define the dual code C ⊥ of C as where • denotes an inner product in R N .All symbols and notations mentioned above will be maintained throughout the manuscript.

Singleton Local Frobenius Rings
From now on, R will denote a finite commutative local ring with a singleton basis and invariants p, n, r, t.Moreover, let g(x) always be defined as where β, β 1 ∈ Γ * (r) and h, h 1 ∈ 1 + pS.By the results of [2], R is structured as For the purpose of simplicity, we need to agree on the following notations 2 ≤ l ≤ m; J l = 0 and J l−1 ̸ = 0.

( * )
The following theorem establishes a powerful tool in characterizing singelton local Frobenius rings based just on their invariants p, n, r, t, d, e.When t = 1, the case is trivial, so we assume, in the theorem, that t > 1.
Proof.Suppose that R is Frobenius, then soc(R) is the minimal ideal which is unique.Furthermore, soc(R) is cyclic by Theorem 2, and thus we can write soc(R) = (θ).In this case, we have θ p = θπ = 0.As θ = s 0 + s 1 π, it is clear that s 0 ∈ p n−1 S and s 1 ∈ p t−1 S, and hence where u, v ∈ Γ(r) but they are not both equal to 0. This means that θ ∈ (p n−1 , To finish the proof, we consider two cases.If u = 0, then soc(R) = (p t−1 π) and since p n−1 π annihilates J, then p n−1 π ∈ soc(R), which means that n = t.On the other hand, suppose that u ̸ = 0.
Corollary 2. Suppose that R is a chain ring, then R is Frobenius.In particular, if n = 1, R is Frobenius.
Proof.The result follows from Theorem 3 since t = n or t = n − 1 and d = 1.

Remark 1.
For any singleton local Frobenius ring R with invariants p, n, r and t, then The following proposition is useful for the next section.
Proposition 1.Let I be any non-zero ideal of a singleton local Frobenius ring R.Then, soc(R) is contained in I.
Proof.Assume that I is an ideal of R. If I is minimal, then I = soc(R) because soc(R) is the unique minimal ideal of R by Corollary 1. Now, suppose I is not minimal ideal, then I contains an ideal which is minimal, and thus contains soc(R).
Remark 2. The number of singleton local rings (up to isomorphism) with π 2 = p d β and invariants p, n, r, t, d is

Full Characterization of Singleton Local Frobenius and Non-Frobenius Rings of Order 32
The following theorem plays a crucial role in our subsequent discussion as it provides a comprehensive classification of all local rings with a singleton basis of order 32.Theorem 4. Suppose R is a singleton local ring of order 32.Then, R is isomorphic to a unique ring among those listed in Table 1.
Table 1.Classification of all singleton local Frobenius and non-Fobenius rings of order 32.

Chain Rings
Non-Chain Rings Non-Frobenius Rings Proof.Since | R |= 32, we have two possible cases: either r = 5 and m = 1, or r = 1 and m = 5.However, the first case does not result in a singleton ring.Therefore, we consider the case where m = 5 and n can be either As h ∈ 1 + pS = {1, 3, 5, 7}, then 1 = 5, 3 = 7 mod 4.Then, the correspondence ϕ between Case a2.Now consider the option where d takes the values of 2 or 3.In this case, the construction and properties of such rings can be further explored and analyzed.
Based on Remark 2, there is exactly one ring of the form R 3 .With respect to rings of type R 1 , there exists a unique class up to isomorphism.Furthermore, there is only one class of each singleton local ring R 2 and R 4 by the same discussion as the previous case.Case b.Let us consider the case where n = 4, which imposes t = 1.In this case, we have e = 1 and d can take values of 3 or 4. Therefore, we list all such rings as The class of R 1 rings consists of one element, and additionally, there is only one ring of type R 2 in light of Remark 2.
We finally employ Theorem 3 to classify all singleton local rings of order 32.They are divided into two categories: chain and non-chain rings.
This ring is not a chain ring and is not the only non-Frobenius singleton local ring, as shown in Table 1.
Remark 3.For non-chain and Frobenius rings, l = m − 1 = 4. On the other hand, for non-Frobenius rings, if we denote l i = l(J(R i )), then the index of nilpotency of J is R i .Thus, simple calculations will lead to l 1 = 3, l 2 = 3, l 3 = 3, l 4 = 4 and l 5 = 3, where R i runs through all rings in the third column.Remark 4. By utilizing the results in our prior publication [2], we successfully classified singleton local rings of order 32.It is worthy to highlight the original contribution of distinguishing between Frobenius and non-Frobenius singleton local rings, as this distinction carries substantial significance in the construction of generating characters discussed in the subsequent section.Furthermore, this new approach has the potential to be extended for the purpose of studying codes over rings with higher orders.

Generating Characters and MacWilliams Identities
Let R be a singleton local Frobenius ring with invariants p, n, r, t and associated polynomial g(x).The following theorem describes an approach to construct a generating character for any singleton local Frobenius ring.In Table 2, we list the resulting generating characters for singleton local Frobenius rings of order 32.

Ring
Additive Structure Generating Character Theorem 5. Suppose that R is a singleton local Frobenius ring with invariants p, n, r, t.Then, there exists an integer q ≥ 1 such that is a generating character of R, where γ i is a p n i -root of unity and a i ≤ mr for each 1 ≤ i ≤ q.
Proof.Since R has a characteristic number p n , there are n = n 1 , n 2 , . . ., n q that satisfy n 1 ≥ n 2 ≥ • • • ≥ n q and so are additive groups, This means that there are u 1 , u 2 , . . .u q , generators satisfying the condition o(u i ) = p n i for 1 ≤ i ≤ q.Thus, every element ω of R is factorized uniquely (in an additive sense) as where a i ∈ Z p n i .As R is Frobenius, then by Proposition 1, any nontrivial ideal encompasses soc(R).Therefore, in order for χ to be a generating character, it is enough to illustrate that a character χ is nontrivial on soc(R).Let us define the following map χ : R → C * by where γ i is a p n i th root of unity in C for each i.One can see that χ is in Hom(R, C * ); that is, it is a character.Suppose that the image of soc(R) under χ is not 1,; then, χ will be a generating character for R. On the contrary, assume that χ(soc(R)) = {1}.Suppose that ω ∈ soc(R).As soc(R) is a cyclic of order p r , then in the additive structure, we can identify soc(R) by Z p r .From group theory, there exists a unique i, 1 ≤ i ≤ q such that Z p r is a subgroup of Z p n i .This imposes χ(a i u i ) = γ a i ̸ = 1 for all a i < p r , and hence χ is a non-trivial character on soc(R).Therefore, χ is a generating character.
The following table presents generating characters for singleton Frobenius local rings of order 32.In the table, γ and ζ are 2 3 th root and 2 4 th root of unity, respectively.

MacWilliams Relations
Now, we completely determine MacWilliams identities of various versions for singleton local Frobenius rings with p, n, r, t.In fact, these relations can hold for a broader class of finite rings, namely the class of all Frobenius rings.These identities play a vital role in coding theory as they establish a crucial link between the weight enumerator of a code and its dual.
Let C be a code over R. The complete weight enumerator is known as where n i (c) means the number of occurrences of a i in c.Suppose that A is a p mr × p mr matrix with a ij = χ(a i a j ).Then, The Hamming weight enumerator is defined as where wt(c) =| {i : . Now, we introduce the MacWilliam identity for the Hamming weight enumerator as We define ∼ on R as a ∼ b if and only if a = ωb, where ω ∈ U(R).It can be easily justified that ∼ is an equivalence relation.Suppose that b1 , . . ., bq are its equivalence classes, and the symmetrized weight enumerator is hence defined by where n ′ i (c) is the number of occurrences of elements of bi in the codeword c.Now, assume that Denote the matrix (b ij ) q×q by B. Then, we define the MacWiliams identity for the SWE (symmetrized weight enumerator) of a linear code C as It is easy to obtain the matrix A in (13) once we have χ.However, computing B in Equation ( 17) requires more computational steps, as we need to determine bi .This process involves more effort but is vital for constructing B. The following theorem gives us a detailed scheme of building B for a more general case.
. Then, the generating character χ is defined on F p r as χ(a where γ is the p−root of unity in C. The equivalence classes are b1 = {0}, b2 = U(R) and b3 = J(R) \ {0}.Therefore, it is clear that b 1j = 1 and b j1 =| bj | .Also, b 33 = p r − 1 and b 23 = δ, which is 0 or −1 according to whether p is odd or even, respectively.Finally, b 32 = −p r .
Remark 5. Theorem 6 can be generalized to a broader class of rings, namely R = F p r [x]/(x k ), k ≥ 3.In this case, the associated matrix B will have dimensions of (k + 1) × (k + 1).
Example 2. If R is with invariants (p, n, r, t) = (2, 1, 2, 1), then the order of R is 2 4 , and Next, we proceed to illustrate these computations through practical demonstration of the steps involved for examples of singleton local Frobenius rings of order 32.Our attention will be focused on understanding the equivalence classes under ∼ and then constructing B. Table 3 presents the associated B of each ring, and also provides all equivalent classes.
From now onwards, the order of R is 32.First, we investigate B of chain rings.
).Let us assume the elements of R have the following order: R = {0, 1, Now, define for a, b ∈ R, a ij = χ(ab), where i and j are the indexes of a and b, respectively.Thus, set A = (a ij ) of size 32 × 32 over C. Note that this matrix is easy to calculate but it is too large.Next, we compute the matrix B which needs extensive computations.We need to obtain bi on R which are listed as To demonstrate the computations, we introduce a few cases, noting that χ(a) = −χ(a + 2x) and χ(a Therefore, If α is a unit, then α bi = bi , where i = 1, 2, 3, .., q.Thus, if the index of α is i, then b ij = b 1j for all j.
Remark 7. From Example 3, all chain rings have an equivalent matrix B.
The following example will involve the case when R is a non-chain ring.There are only unique rings of this type, which are R = Z 2 4 [x]/(x 2 − 8, 2x).In this ring, J = (x, 2), which is of order 16 and its index of nilpotency is l = 4, and finally soc(R) = (p n−1 π).
Example 4. Consider the non-chain ring R = Z 2 4 [x]/(x 2 − 8, 2x) which has (p, n, r, t) = (2, 4, 1, 1) as invariants.Assume the order of elements of R as follows: if i, j ∈ Z 2 4 , then i is before j if i < j as integers, and i + x before j + x if i precedes j.Thus, the equivalence classes are Thus, using the associated generating character in Table 2 and after appropriate calculations as in Example 3,

Generator Matrices
In coding theory, one of the essential techniques is creating a generator matrix in standard form for a linear code over finite rings.In this section, we determine generator matrices for linear codes over singleton local Frobenuis rings with invariants 2, n, r, t and n + t = 5.Compared to codes over chain rings, constructing a generator matrix is more challenging when studying codes over singleton local Frobenius rings that are non-chains.Although a basic set of generators can still be found, such a generator matrix may not provide simple information on the code size or amount of codewords.This is not the case with codes across chain rings, where a generator matrix may be used to easily compute the code size.
Let C be a linear code over R i , i = 2, 3, 4.Then, C has a generator matrix with standard form [11], where I e denotes the e × e identity matrix.A linear code which has a generator matrix of this form is called a code of type {e 0 , e 1 , e 2 , e 3 , e 4 }, and therefore its size is equal to Definition 2. We call the vectors v 1 , . . ., v e modular independent if no nontrivial linear combination of the vectors exists with coefficients from J that equals the zero vector.A generator matrix G over the ring R is considered as such if the rows of G are modularly independent and they generate the code C.
The remainder of this section deals with singleton local Frobenius rings of order 32, where M ij are matrices over R.
Proof.Suppose that G is a matrix whose rows generate C as an R-module.We move all columns that have a unit in them to the left of G.By performing row reduction on those columns, we get a matrix of the form Now, all elements of A are not units.We again move all columns that have elements in J = (2, π) to the left, and impose the main row operations to transfer the matrix to a form of the following.
We proceed with this algorithm, ensuring that the matrix A 1 is constructed by arranging columns with elements that form a pair (2, π),, and we repeat this process until the matrix is in the desired form.
where the entries of columns of the matrix A 2 are elements of only one ideal of the ideals (2), (π), (2 + π) and (4 + π).So, now we proceed with the matrix A 2 .In order to create a unique representation of the matrix, we select a specific ordering for the four ideals: (π), (4 + π), (2), and (2 + π).This chosen order will be used consistently when constructing the matrix.Let u be a unit of R; we first continue with columns whose entries are of the form πu, then with columns of (π + 4)u, and next with columns that have elements of the form (2)u. Finally, we deal with columns of the form (π + 2)u.In each step, we perform row reduction in the usual manner.Note that the ideal (4) is contained in both (2) and (π + 2), and thus we repeat the same procedure with this ideal, since all remaining entries of the columns will be from the ideal (4).
Finally, all elements of A 3 are from the ideal generated by 8.By eliminating any rows containing only zeros and performing a final round of row reduction, we ultimately obtain a matrix that precisely matches the desired form we were aiming for.
Proposition 2. Suppose that u is a vector in R N .Let M = (u) be a cyclic R-submodule of R N .
Proof.Assume that I is an ideal generated by coordinates of the vector u.Let T be the set of all annihilators of u in R, which is an ideal of R. Thus, According to Figure 1, we have six possibilities for the order of I ∈ {32, 16, 8, 4, 2, 0}.The result follows.
Definition 2. We call the vectors v 1 , . . ., v e modular independent if there exists no nontrivial 170 linear combination of the vectors with coefficients from J that equals the zero vector.A generator 171 matrix G over the ring R is considered as such if the rows of G are modularly independent and they 172 generate the code C.

173
The reminder of this section deals with singleton local Frobenius rings of order 32, The following figure shows the ideals lattice of R. As we know that | J |= 16, | (2) |=| 174 (π) |=| (π + 2) |= 8, | (π + 4) |=| (4) |= 4 and | (8) = soc(R) |= 2. Therefore, our aim, in 175 this section, is to create a set of modularly independent elements which serve as the rows of 176 a generator matrix for a given code.The subsequent theorem provides a full representation 177 of the structure of a generator matrix.The last example illustrates that it is possible for a code over a singleton local Frobenius (non-chain) ring to not have a minimal set of generators in standard form, making it difficult to determine the code size.In other words, it illustrates the distinction between codes over local non-chain rings and codes over chain rings.

Example 6 .
Assume C is a linear code over Z 2 4 [x]/(x 2 − 8, 2x) with a generator matrix of the form G = is an isomorphism.In addition, the same can be imposed on the rings Z 2 3 [x]/(x 2 − 2(3), 4x) and Z 2 3 [x]/(x 2 − 2(7), 4x).This concludes that there are two rings (up to isomorphism) of type R 1 which are of the form Z 2 3 [x]/(x 2 − 2, 4x) and Z 2 3 [x]/(x 2 + 2, 4x).Now, we classify rings of type R 2 .Because d = e, then the last term of g(x) = x 2 − 2h − 2x determines the classes of such rings; i.e., there is only one class that represents these rings, which is

Table 2 .
χ for singleton Frobenius local rings of order 32.

Table 3 .
MacWilliams SWE matrices for singleton local Frobenius rings of order 32