• Bordered Constructions of Self-Dual Codes from Group Rings and New Extremal Binary Self-Dual Codes

      Dougherty, Steven; Gildea, Joe; Kaya, Abidin; Korban, Adrian; Tylyshchak, Alexander; Yildiz, Bahattin; University of Scranton; University of Chester; Sampoerna Academy; Uzhgorod State University; Northern Arizona University (Elsevier, 2019-02-22)
      We introduce a bordered construction over group rings for self-dual codes. We apply the constructions over the binary field and the ring $\F_2+u\F_2$, using groups of orders 9, 15, 21, 25, 27, 33 and 35 to find extremal binary self-dual codes of lengths 20, 32, 40, 44, 52, 56, 64, 68, 88 and best known binary self-dual codes of length 72. In particular we obtain 41 new binary extremal self-dual codes of length 68 from groups of orders 15 and 33 using neighboring and extensions. All the numerical results are tabulated throughout the paper.
    • Composite Constructions of Self-Dual Codes from Group Rings and New Extremal Self-Dual Binary Codes of Length 68

      Dougherty, Steven; Gildea, Joe; Kaya, Abidin; Korban, Adrian; University of Scranton; University of Chester; Sampoerna University ; University of Chester (American Institute of Mathematical Sciences, 2019-11-30)
      We describe eight composite constructions from group rings where the orders of the groups are 4 and 8, which are then applied to find self-dual codes of length 16 over F4. These codes have binary images with parameters [32, 16, 8] or [32, 16, 6]. These are lifted to codes over F4 + uF4, to obtain codes with Gray images extremal self-dual binary codes of length 64. Finally, we use a building-up method over F2 + uF2 to obtain new extremal binary self-dual codes of length 68. We construct 11 new codes via the building-up method and 2 new codes by considering possible neighbors.
    • Composite Matrices from Group Rings, Composite G-Codes and Constructions of Self-Dual Codes

      Dougherty, Steven; Gildea, Joe; Korban, Adrian; Kaya, Abidin; University of Scranton; University of Chester; Harmony School of Technology (Springer, 2021-05-19)
      In this work, we define composite matrices which are derived from group rings. We extend the idea of G-codes to composite G-codes. We show that these codes are ideals in a group ring, where the ring is a finite commutative Frobenius ring and G is an arbitrary finite group. We prove that the dual of a composite G-code is also a composite G-code. We also define quasi-composite G-codes. Additionally, we study generator matrices, which consist of the identity matrices and the composite matrices. Together with the generator matrices, the well known extension method, the neighbour method and its generalization, we find extremal binary self-dual codes of length 68 with new weight enumerators for the rare parameters $\gamma$ = 7; 8 and 9: In particular, we find 49 new such codes. Moreover, we show that the codes we find are inaccessible from other constructions.
    • Constructing Self-Dual Codes from Group Rings and Reverse Circulant Matrices

      Gildea, Joe; Kaya, Abidin; Korban, Adrian; Yildiz, Bahattin; University of Chester; Sampoerna Academy; Northern Arizona University (American Institute of Mathematical Sciences, 2020-01-20)
      In this work, we describe a construction for self-dual codes in which we employ group rings and reverse circulant matrices. By applying the construction directly over different alphabets, and by employing the well known extension and neighbor methods we were able to obtain extremal binary self-dual codes of different lengths of which some have parameters that were not known in the literature before. In particular, we constructed three new codes of length 64, twenty-two new codes of length 68, twelve new codes of length 80 and four new codes of length 92.
    • Extending an Established Isomorphism between Group Rings and a Subring of the n × n Matrices

      Dougherty, Steven; Gildea, Joe; Korban, Adrian; University of Scranton; University of Chester
      In this work, we extend an established isomorphism between group rings and a subring of the n × n matrices. This extension allows us to construct more complex matrices over the ring R. We present many interesting examples of complex matrices constructed directly from our extension. We also show that some of the matrices used in the literature before can be obtained by a direct application of our extended isomorphism.
    • G-codes over Formal Power Series Rings and Finite Chain Rings

      Dougherty, Steven; Gildea, Joe; Korban, Adrian; University of Scranton; University of Chester (2020-02-29)
      In this work, we define $G$-codes over the infinite ring $R_\infty$ as ideals in the group ring $R_\infty G$. We show that the dual of a $G$-code is again a $G$-code in this setting. We study the projections and lifts of $G$-codes over the finite chain rings and over the formal power series rings respectively. We extend known results of constructing $\gamma$-adic codes over $R_\infty$ to $\gamma$-adic $G$-codes over the same ring. We also study $G$-codes over principal ideal rings.
    • G-Codes, self-dual G-Codes and reversible G-Codes over the Ring Bj,k

      Dougherty, Steven; Gildea, Joe; Korban, Adrian; Sahinkaya, Serap; Tarsus University; University of Chester (Springer, 2021-05-03)
      In this work, we study a new family of rings, Bj,k, whose base field is the finite field Fpr . 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 to a code over Bl,m 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-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.
    • New binary self-dual codes of lengths 56, 58, 64, 80 and 92 from a modification of the four circulant construction.

      Gildea, Joe; Korban, Adrian; Roberts, Adam; University of Chester (Elsevier, 2021-05-31)
      In this work, we give a new technique for constructing self-dual codes over commutative Frobenius rings using $\lambda$-circulant matrices. The new construction was derived as a modification of the well-known four circulant construction of self-dual codes. Applying this technique together with the building-up construction, we construct singly-even binary self-dual codes of lengths 56, 58, 64, 80 and 92 that were not known in the literature before. Singly-even self-dual codes of length 80 with $\beta \in \{2,4,5,6,8\}$ in their weight enumerators are constructed for the first time in the literature.
    • New Extremal binary self-dual codes of length 68 from generalized neighbors

      Gildea, Joe; Kaya, Abidin; Korban, Adrian; Yildiz, Bahattin; University of Chester; Sampoerna University; Northern Arizona University
      In this work, we use the concept of distance between self-dual codes, which generalizes the concept of a neighbor for self-dual codes. Using the $k$-neighbors, we are able to construct extremal binary self-dual codes of length 68 with new weight enumerators. We construct 143 extremal binary self-dual codes of length 68 with new weight enumerators including 42 codes with $\gamma=8$ in their $W_{68,2}$ and 40 with $\gamma=9$ in their $W_{68,2}$. These examples are the first in the literature for these $\gamma$ values. This completes the theoretical list of possible values for $\gamma$ in $W_{68,2}$.
    • New Extremal Self-Dual Binary Codes of Length 68 via Composite Construction, F2 + uF2 Lifts, Extensions and Neighbors

      Dougherty, Steven; Gildea, Joe; Korban, Adrian; Kaya, Abidin; University of Scranton; University of Chester; University of Chester; Sampoerna Academy; (Inderscience, 2020-02-29)
      We describe a composite construction from group rings where the groups have orders 16 and 8. This construction is then applied to find the extremal binary self-dual codes with parameters [32, 16, 8] or [32, 16, 6]. We also extend this composite construction by expanding the search field which enables us to find more extremal binary self-dual codes with the above parameters and with different orders of automorphism groups. These codes are then lifted to F2 + uF2, to obtain extremal binary images of codes of length 64. Finally, we use the extension method and neighbor construction to obtain new extremal binary self-dual codes of length 68. As a result, we obtain 28 new codes of length 68 which were not known in the literature before.
    • New Self-Dual Codes of Length 68 from a 2 × 2 Block Matrix Construction and Group Rings

      Bortos, Maria; Gildea, Joe; Kaya, Abidin; Korban, Adrian; Tylyshchak, Alexander; Uzhgorod National University, University of Chester, Harmony School of Technology, University of Chester, Uzhgorod National University
      Many generator matrices for constructing extremal binary self-dual codes of different lengths have the form G = (In | A); where In is the n x n identity matrix and A is the n x n matrix fully determined by the first row. In this work, we define a generator matrix in which A is a block matrix, where the blocks come from group rings and also, A is not fully determined by the elements appearing in the first row. By applying our construction over F2 +uF2 and by employing the extension method for codes, we were able to construct new extremal binary self-dual codes of length 68. Additionally, by employing a generalised neighbour method to the codes obtained, we were able to con- struct many new binary self-dual [68,34,12]-codes with the rare parameters $\gamma = 7$; $8$ and $9$ in $W_{68,2}$: In particular, we find 92 new binary self-dual [68,34,12]-codes.
    • Self-Dual Codes using Bisymmetric Matrices and Group Rings

      Gildea, Joe; Kaya, Abidin; Korban, Adrian; Tylyshchak, Alexander; University of Chester ; Sampoerna University ; University of Chester: Uzhgorod National University (Elsevier, 2020-08-14)
      In this work, we describe a construction in which we combine together the idea of a bisymmetric matrix and group rings. Applying this construction over the ring F4 + uF4 together with the well known extension and neighbour methods, we construct new self-dual codes of length 68: In particular, we find 41 new codes of length 68 that were not known in the literature before.