G-codes, self-dual G-codes and reversible G-codes over the ring Bj,k\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}${\mathscr{B}}_{j,k}$\end{document}

In this work, we study a new family of rings, Bj,k\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}${\mathscr{B}}_{j,k}$\end{document}, whose base field is the finite field Fpr\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}${\mathbb {F}}_{p^{r}}$\end{document}. We study the structure of this family of rings and show that each member of the family is a commutative Frobenius ring. We define a Gray map for the new family of rings, study G-codes, self-dual G-codes, and reversible G-codes over this family. In particular, we show that the projection of a G-code over Bj,k\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}${\mathscr{B}}_{j,k}$\end{document} to a code over Bl,m\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}${\mathscr{B}}_{l,m}$\end{document} is also a G-code and the image under the Gray map of a self-dual G-code is also a self-dual G-code when the characteristic of the base field is 2. Moreover, we show that the image of a reversible G-code under the Gray map is also a reversible G2j+k\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$G^{2^{j+k}}$\end{document}-code. The Gray images of these codes are shown to have a rich automorphism group which arises from the algebraic structure of the rings and the groups. Finally, we show that quasi-G codes, which are the images of G-codes under the Gray map, are also Gs-codes for some s.


Introduction
In [1], a new family of rings, The base field of this ring is the finite field of order 4, denoted by F 4 . This family of rings was used to construct codes which were reversible, which is a desirable quality for DNA codes. In the present work, we generalise the family of rings F j,k so that the base field is in an arbitrary finite field F p r . We also define a Gray map which is a generalization of the Gray map given in [1,13,14].
Assume the indeterminates u i and v i all commute. Definition 1.1 Let p be a prime and let F p r be the finite field of order p r . Let This definition generalises the definition of F j,k in [1] as well as the rings R k = F 2 [u 1 , u 2 , . . . , u k ]/ u 2 i = 0 in [6][7][8], the rings [11]. In essence, all of the families of rings were studied together with Gray maps to ambient spaces over finite fields. They use the algebraic structure of the family of rings to obtain desirable properties for the codes over finite fields. One desirable property is that one can obtain codes with a rich automorphism group via the algebraic structure of the ring through the Gray map. In this construction, one can find codes that might have been missed by more classical construction techniques, for example, one may find extremal binary selfdual codes with new weight enumerators or with a different orders of the automorphism group. Further in [4], G-codes were used to construct binary self-dual codes from codes over R k . By combining these techniques, self-dual binary codes with very rich automorphism groups were found which had been missed during the decades long search for binary selfdual codes. The primary reason was that these techniques allowed the authors to find codes that had different automorphism groups than those constructed from the usual techniques. It is precisely this type of scenario we exploit in the present paper. Our goal is to study the algebra of the new family of rings, the corresponding Gray maps, and the group G, so that one can employ our results to construct useful and interesting codes over finite fields that would not be constructed with other techniques. Additionally, we present matrix constructions for self-dual and reversible Gcodes and study their properties over the new family of rings.

The ring B j,k
We begin by describing the family of rings B j,k . Set Proof The commutativity of the ring follows from the fact that F p r is commutative and that the indeterminates commute. Since the characteristic of F p r is p, then B j,k has characteristic p. When we look at the representation of elements of B j,k given in (2.1), we see that there are 2 j 2 k = 2 j +k subsets and p r choices for each coefficient c A,B . This gives that B j,k has cardinality (p r ) 2 j +k .
We now give some structural theorems about the family of rings.

Theorem 2.2
Let j and k be non-negative integers.
An element a is a unit in B j,k if and only if the projection to each component of Proof The ideals v j and 1 + v j are relatively prime ideals. By Lemma 2.3 in [3], we have that B j,k ∼ = B j −1,k × B j −1,k . Then, by induction on j , we have the first result. The second result follows immediately from the isomorphisms in the first.
Since B j,k is isomorphic to ⊕ 2 j i=1 B 0,k , it is natural to look at the structure of the ring B 0,k = F p r [u 1 , u 2 , . . . , u k ]/ u 2 i to understand the structure of B j,k .
Proof First, we note that if A = ∅, then u 2 A = 0. Then, we see that the coefficient of any monomial in this expansion, other than the first or the last is divisible by p and hence 0. Therefore, all of the terms are 0. Proof We write an element in B 0,k as c ∅ + A⊂[k] c A u A by hypothesis, with c ∅ = 0. Since the ring has characteristic p and by Lemma 2.3, the inverse of c ∅ + A⊂[k] c A u A is: when c ∅ = 0. Therefore it is a zero-divisor. Lemma 2.4 gives the other direction. Next, let m = u 1 , u 2 , . . . , u k . Elements of this ideal are all of the form, c ∅ + This is necessarily all non-units and is therefore the unique maximal ideal.

Theorem 2.6
The ring B j,k is not local for non-zero j .
Proof The ring B j,k is isomorphic to ⊕ 2 j i=1 B 0,k by Theorem 2.2. Then each ideal corresponding to the sum of (k − 1) zero-ideals with one copy of B 0,k is a maximal ideal. Therefore, the ring is not local.
As an example of this, consider the ring The ring is isomorphic via Theorem 2.2 to F p × F p . This ring has two maximal ideals corresponding to F p × {0} and to {0} × F p . Therefore, the ring is not local.
Given the definition of inner-product and the fact that the ring is commutative it is easy to see that for any ideal I , Ann(I ) = I ⊥ . We use this result in the following theorem. Theorem 2.7 Let I 1 = u i 1 u i 2 · · · u i s and I 2 = u i 1 , u i 2 , . . . , u i s be ideals of B 0,k , where i = i , when = . Then |I 1 | = (p r ) 2 k−s and |I 2 | = (p r ) 2 k −2 k−s .
Proof Elements of I 1 are in the form of For the second statement, elements of I 2 are in the same form. But this time, the subsets of [k] differ. More precisely, subsets must have at least one of {i 1 , i 2 , . . . , i s }. It can be easily obtained that there are 2 k − 2 k−s such subsets. Hence |I 2 | = (p r ) 2 k −2 k−s . Proof We have I ⊥ 2 ⊆ I 1 by the fact that u i j u A = 0 where A = {i 1 , i 2 , . . . , i s } and u i j ∈ A. Equality follows from Theorem 2.7 by using the fact that B 0,k is a Frobenius ring and examining the cardinalities.

Corollary 2.9
The ideal u i is a self dual code of length 1 for 1 ≤ i ≤ k.
Proof Follows from Theorem 2.7.

Gray maps
Gray maps have been one of the most important aspects of codes over rings. In essence, they are a map from the n fold product of the ring to an ambient space where the finite field is the alphabet. This map emanates from the map that sends elements of the ring to elements in the the s fold product of the finite field, where s is determined by the ring. This map, in general, preserves weight and its intention is to create interesting codes over the finite field from codes over the ring.
In this section, we define a Gray map : B j,k → F 2 j +k p r . The map we give is a generalization of the map given in [1] as well as those given in [2,[6][7][8], and [9].
We can view B j,k as B j,k−1 + u k B j,k−1 and write each element of B j,k as a + bu k . Then we can define the map : B j,k → B 2 j,k−1 as follows: We can view B j,k as B j −1,k + v j B j −1,k and write each element of B j,k as a + bv j . Then we can define the following map : B j,k → B 2 j −1,k as follows: We now define the map : B j,k → F 2 j +k p r as follows: Lemma 2.10 Let C be a linear code over B j,k of length n. Then (C) is a linear code of length n(2 j +k ).
Proof First, we shall show that the map is linear. We have that .
This gives that is linear. Now, we show that the map is also linear. We have This gives that is linear. Then the map is the composition of j + k linear maps and therefore the map is a linear map.
Define the swap maps σ 1 , σ 2 , . . . , σ k that act on F 2 j +k p r as follows: The next theorem shows that the map gives some automorphisms in the image under certain conditions.

Theorem 2.11
If the base field of B j,k has characteristic 2 and C is a linear code over B j,k , then (C) has k swap maps, σ 1 , σ 2 , . . . , σ k in their automorphism group.
Proof Given an element a + bu k , multiplication by 1 + u k gives (1 + u k )(a + bu k ) = a +(a +b)u k . We see that (a +bu k ) = (b, a +b) and (a +(a +b)u k ) = (a +b, 2a +b). Therefore, if the characteristic of the finite field is 2, then (a + (a + b)u k ) = (a + b, b). This gives that for characteristic 2, multiplication by the unit 1 + u i , for each i induces an automorphism of order 2 in the image that corresponds to a swap map. Finally, let σ i denote the induced by multiplication by 1 + u i . This gives the result.
We now generalize two results from [2] and [6] respectively, where it is shown that for the maps defined in (2.5) and (2.6), the following two hold when the base field of the ring is F 2 . We now show that the two hold for the ring B j,k only when the base field is F 2 r .
and let : B j,k → B 2 j −1,k be defined as: Then (C ⊥ ) = ( (C)) ⊥ and (C ⊥ ) = ( (C)) ⊥ if and only if the characteristic of the ring B j,k is 2.
Proof We prove the result for . The proof for is similar.
The images of the vectors have the following inner-product: This will only be zero if the characteristic of the ring B j,k is 2, i.e., the base field is F 2 r . Assuming that the characteristic of the ring B j,k is 2 gives that ( We now have the following result.

Theorem 2.13 Let C be a linear code over
Proof Follows from Lemma 2.12. Corollary 2.14 Let C be a self-dual code over Proof Follows from Theorem 2.13 and Lemma 2.10.

Characters
In this section, we show that the ring B j,k is a Frobenius ring by showing that there is a generating character for the associated character module. Recall that a character of the module M is a homomorphism χ : M → C * . We note that some have the codomain as the rationals and use the additive operation rather than the non-zero complex numbers with multiplication. But we shall maintain the notation given in [3], where one can find a complete description of the relationship between characters and codes. Denote by M the character module of M. Let R be a Frobenius ring and let φ : R → R be the module isomorphism. Set χ = φ(1), giving φ(r) = χ r for r ∈ R. We call this character χ a generating character for R. Note that there is not a unique generating character. But by providing a generating character for a commutative ring, we show that the ring is, in fact, Frobenius. This is because a finite commutative ring R is Frobenius if and only if R has a generating character, see [3].
In the present situation, we have that the ring B j,k is isomorphic to We need only to find a generating character for B 0,k then if χ B 0,k is the generating character for B 0,k , we have that the character χ for R defined by where a corresponds to (a 1 , a 2 , . . . , a s ) via the isomorphism, is a generating character for B j,k . To do this, we recall that any finite field of order p e can be written as Then each element in F p e can be written as a i ξ i where a i ∈ F p . This leads immediately to the following lemma.

Lemma 2.15
The showing that the ring is Frobenius.
Proof We have already explained why each element can be written in that form.
The unique minimal ideal of B 0,k is the orthogonal of the unique maximal ideal. Therefore, the minimal ideal is a = u 1 u 2 · · · u k . It follows that any ideal that is contained in ker(χ) must contain the ideal a. But we have that χ(u 1 u 2 · · · u k ) = η which gives that ker(χ) contains no non-trivial ideal. It follows that the map is a generating character and then the ring B 0,k is a Frobenius ring.
The next theorem follows from the fact that the ring decomposes by the Chinese Remainder Theorem.

Theorem 2.16 Let
The ring B j,k ∼ = ⊕ 2 j i=1 B 0,k has a generating character of the form: giving that the ring B j,k is a Frobenius ring.
Proof We have that B j,k is isomorphic to ⊕ 2 j i=1 B 0,k . It follows that the generating character is χ from Lemma 2.15.
Then the ring is Frobenius since it has a generating character.
Let T be a square (p r ) 2 j +k by (p r ) 2 j +k matrix indexed by the elements of B j,k and let where χ is the generating character of B j,k .
Recall that the complete weight enumerator of a code C is defined as where there are n i (c) occurrences of a i in the vector c. It follows that if C is a linear code over B j,k , then By collapsing T as in [15], we get that if C is a linear code over B j,k , then where W C (x, y) denotes the Hamming weight enumerator of C. Now recall that the Lee weight enumerator of a code C is defined as: where N is the length of (C). From Section 2, we know that when the characteristic of the finite field is 2, then (C ⊥ ) = (C) ⊥ which allows us to find the MacWilliams identities for the Lee weight enumerators of codes over in the following way: where Lee C (z) is the Lee weight enumerator and W denotes the Hamming weight enumerator. This leads to the following theorem.

Theorem 2.17
Let C be a code of length n over

G-Codes over B j,k
In this section, we study group codes which we refer to as G-codes, over the ring B j,k . The point of group codes is to construct codes that are invariant canonically by the action of a group G. This technique allows us to construct codes which other construction methods do not find. Moreover, by applying the Gray map we are able to construct codes over a finite field that are quasi-G codes, which mean they are held invariant by a different group and are endowed with algebraic structure of the original ring.

Group rings
We begin by giving the standard definitions of group rings and their algebraic operations. Let G be a finite group of order n and let R be a finite ring, then any element in RG is of the form v = n i=1 α i g i , α i ∈ R, g i ∈ G. We note that group rings in general do not require the ring to be finite, but in our setting these are precisely the rings that we are interested in, since we want to use them as alphabets of codes.
Addition in the group ring is done by coordinate addition, namely The product of two elements in a group ring is given by This gives that the coefficient of g k in the product is g i g j =g k α i β j .
We recall a construction of linear codes in R n from the group ring RG, where G is a finite group of order n. This construction was first given for codes over fields by Hurley in [10] and this construction was extended to codes over finite commutative Frobenius rings in [4]. Let R be a finite commutative Frobenius ring and let G = {g 1 , g 2 , . . . , g n } be a group of order n. Let v = α g 1 g 1 + α g 2 g 2 + · · · + α g n g n be an element in RG. Then define the following matrix σ (v) ∈ M(R) to be: Note that the elements g −1 1 , . . . , g −1 n are simply the elements of the group G given in some order. There is not a canonical reason for this, but rather this particular order aids in certain proofs and computations.
For a given element v ∈ RG, we define the following code over the ring R: Namely, the code C(v) is the code formed by taking the row space of the matrix σ (v) over the finite ring R. It follows immediately that the code C(v) is a linear code, since it is row space of a generator matrix. We stress that in no way are we assuming that the matrix C(v) is in any way a minimal generating set for the code. In general it is not. We recall the following definitions from [5] that we apply in our setting: • Let B j,k be a local Frobenius ring with unique maximal ideal m i , and let w 1 , . . . , w s be vectors in B n j,k . Then w 1 , . . . , w s are modular independent if and only if α j w j = 0 implies that α j ∈ m i for all j . • Let w 1 , . . . , w s be non-zero vectors in B n j,k . Then w 1 , . . . , w s are independent if α j w j = 0 implies that α j w j = 0 for all j .
In [5], it is shown that if the ring is local, then any modular independent set is a minimal generating set and that if the ring is not local then any set that is both modular independent and independent is a minimal generating set. We shall call such a set a basis for the code.
In [4], it is shown that G-codes are linear codes in R n if and only if they are left ideals in a group ring. Specifically, let v ∈ B j,k G and let C(v) be the corresponding code in B n j,k . Let I (v) be the set of elements of B j,k G such that α i g i ∈ I (v) if and only if (α 1 , α 2 , . . . , α n ) ∈ C(v). Then I (v) is a left ideal in B j,k G.
The following is immediate from these results.

Lemma 3.1 Let v ∈ RG, where R is a finite ring and G is a finite group. Then Aut (C(v)) contains G as a subgroup.
Proof This follows from the fact that the action of G on the coordinates of C(v) necessarily holds the code invariant, since it corresponds to an ideal in the group ring.
It is also shown in [4] that for a commutative Frobenius ring R, if C is a G-code for some G then its orthogonal C ⊥ is also a G-code.
The following definition is given in [4].

Definition 3.2
Let G be a finite group of order n and R a finite Frobenius commutative ring. Let D be a code in R sn where the coordinates can be partitioned into n sets of size s where each set is assigned an element of G. If the code D is held invariant by the action of multiplying the coordinate set marker by every element of G then the code D is called a quasi-group code of index s.
The following is immediate from the definition.

Lemma 3.4 Let G be a finite group of order n and R a finite Frobenius commutative ring. A quasi-G code of index s in R sn is equivalent to a group code under the action of the finite group G s .
Proof Consider a quasi-G code of index s in R ns . Reorder the coordinates of R ns so that the n coordinates in the orbit of a coordinate under the action of group G are grouped together. Then the coordinates in R ns are arranged into s copies of n coordinates where the code is held invariant by the action of the group G on each block of n coordinates. This gives the result.
These two lemmas lead to the following important theorem.
Theorem 3.5 Let C be a linear G-code over B j,k , then (C) is a G 2 j +k code over F p r , which gives that Aut (C) necessarily contains G 2 j +k as a subgroup.
Proof Lemma 3.3 gives that (C) is a quasi-G code of index 2 j +k , then Lemma 3.4 gives that (C) is a G 2 j +k code. Finally Lemma 3.1 gives that Aut (C) necessarily contains G 2 j +k as a subgroup.
This theorem can be extended even further in the case when the base field has even order.

Corollary 3.6
Let C be a linear G-code over B j,k , where the base field is F 2 r . Then Aut (C) necessarily contains G 2 j +k and k swap maps which generate an additional subgroup.
Proof Theorem 3.5 gives the first part and Corollary 2.14 gives the second part.

Projections and lifts of self-dual G-codes over B j,k
Define π k,m : B j,k → B j,m by π k,m (u i ) = 0 if i > m and the identity elsewhere. That is, π k,m is the projection of B j,k to B j,m . Note that if k ≤ m, then π k,m is the identity map on B j,k . Also define π j,l : B j,k → B l,k by π j,l (v i ) = 0 if i > l and the identity elsewhere. That is, π j,l is the projection of B j,k to B l,k . Note that if j ≤ l, then π j,l is the identity map on B j,k . Now, let a ∈ B j,k and define  (π k,m (a)). That is, (j,k),(l,m) is the projection of B j,k to B l,m .
We allow j and k to be ∞ as well and denote this map as (∞,∞), (l,m) . In this case the ring B ∞,∞ is an infinite ring. If C = (j,k),(l,m) (C ) for some C and j > l, k > m, then C is said to be a lift of C.
To show that (j,k),(l,m) (C(v)) is also a G-code, we notice that the pro-

Theorem 4.3
Let w ∈ B l,m G generate a self-dual G-code over B l,m . Then w generates a self-dual code over B j,k for all j > l and k > m. Moreover, the self-dual code over B j,k is also a G-code.
Proof Let C j,k be the code generated by w ∈ B j,k G. We proceed by induction. We know C l,m is a self-dual G-code by assumption.
Assume C j,k is a self-dual G-code. We have that C j,k = σ (w) , where w ∈ B j,k G, C j +1,k = C j,k ⊕ v j +1 C j,k , where C j,k ∩ v j +1 C j,k = ∅ and C j,k+1 = C j,k + u k+1 C j,k , where C j,k ∩ u k+1 C j,k = ∅. Then we have that C j +1,k = σ (w) ⊕ v j +1 σ (w) , C j,k+1 = σ (w) ⊕ u k+1 σ (w) and |C j +1,k | = |C j,k ||C j,k | = (p r ) 2 j +k (p r ) 2 j +k = (p r ) 2 j +k+1 = |C j,k+1 |. Then for vectors w, z, w , z ∈ C j,k we have (since C j,k is self-dual by assumption), Hence C j +1,k and C j,k+1 are self-dual codes since both are self-orthogonal and both have the proper cardinality. Therefore by mathematical induction C j,k is a self-dual code for all finite j and k.
Next we prove that C ∞,∞ is self-dual. If z, w ∈ C ∞,∞ then there exist j and k with z, w ∈ C j,k and hence then w ∈ C ⊥ j,k for some j and k which gives that w ∈ C j,k and hence in C ∞,∞ . Therefore C ∞,∞ is self-dual.
To show that C j,k is also a G-code, let w = α g 1 g 1 + α g 2 g 2 + · · · + α g n g n , where α g i ∈ B l,m . Then we see that As a consequence of the above theorem, we have the following result.

The gray image of G-codes over B j,k
In this section, we restrict our attention to the ring B j,k = F 2 r [v 1 , v 2 , . . . , v j , u 1 , u 2 , . . . , u k ]/ v 2 i − v i , u 2 i and employ the Gray map defined in Section 2. We extend the Gray map linearly to all of B j,k and define the Lee weight of an element in B j,k to be the Hamming weight of its image. We get a linear distance preserving map from B n j,k to F 2 j +k n 2 r . From Theorem 2.13 we know that for any linear code over B j,k we have (C ⊥ ) = (C) ⊥ . As a consequence of this, we get the following result.
Proof From the definition of a G-code, we know that C is linear. The rest follows from Theorem 2.13. C is a self-dual G-code of length n over B j,k , then (C) is a self-dual G-code of length n(2 j +k ) over F 2 r .

Theorem 5.3
Let C be a self-dual G-code over B j,k of length n, then (C) is a self-dual G n -code of length n(2 j +k ) over F 2 r . If the base field is the binary field and the Lee weight of every codeword is 0 (mod 4), then (C) is a Type II binary code.
Since is distance preserving, the following corollary immediately follows from the bounds given in [12]. Note that for j ≥ 1 and k ≥ 1, the length of the binary image of a code over B j,k will always be divisible by 4, hence the case n ≡ 22 (mod 24) is not possible for the image of an B j,k code.

Reversible G-codes over B j,k
Lastly in this paper, we extend some results from [1] on reversible G-codes. We start with a definition.
Definition 6.1 A code C is said to be reversible of index α if a i is a vector of length α and c α = (a 0 , a 1 , . . . , a s−1 ) ∈ C implies that (c α ) r = (a s−1 , a s−2 , . . . , a 1 , a 0 ) ∈ C.
For the remainder of this section, we fix the listing of the group elements as follows. Let G be a finite group of order n = 2l and let H = {e, h 1 , h 2 , . . . , h l−1 } be a subgroup of index 2 in G. Let β / ∈ H be an element in G, with β −1 = β. We list the elements of G = {g 1 , g 2 , . . . , g n } as follows: {e, h 1 , . . . , h l−1 , βh l−1 , βh l−2 , . . . , βh 2 , βh 1 , β}. (6.1) In [1], the following is proven. We now employ the map defined in Section 2 and prove the following result. ∈ H be an element in G with β −1 = β and list the elements of G as in (6.1) . If C is a linear G-code in B j,k (a left ideal in B j,k G), then (C) is a reversible G 2 j +k -code over F p r .

Conclusion
In this work, we studied G-codes, self-dual G-codes and reversible G-codes over a new family of rings B j,k . In particular, we showed that the projection of a G-code over B j,k to a code over B l,m is also a G-code, we defined a Gray map for the new family of rings and showed that the image of a self-dual G-code under this Gray map is also a self-dual G-code.
We also proved that the image of a reversible G-code under the Gray map is a reversible G 2 j +k -code and that the images of G-codes under the Gray map are G s -codes for some s. A suggestion for future research is to search for self-dual G-codes or other families of codes over our new family of rings. We believe that many interesting codes can be obtained as Gray images of the codes over the ring B j,k since as we showed in this work, the Gray images of the codes over the ring B j,k have rich automprphism groups.
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.