Browsing Mathematics by Authors
Now showing items 111 of 11

2^n Bordered Constructions of SelfDual codes from Group RingsDougherty, Steven; Gildea, Joe; Kaya, Abidin; University of Scranton; University of Chester; Sampoerna Academy (Elsevier, 20200804)Selfdual codes, which are codes that are equal to their orthogonal, are a widely studied family of codes. Various techniques involving circulant matrices and matrices from group rings have been used to construct such codes. Moreover, families of rings have been used, together with a Gray map, to construct binary selfdual codes. In this paper, we introduce a new bordered construction over group rings for selfdual codes by combining many of the previously used techniques. The purpose of this is to construct selfdual codes that were missed using classical construction techniques by constructing selfdual codes with diﬀerent automorphism groups. We apply the technique to codes over ﬁnite commutative Frobenius rings of characteristic 2 and several group rings and use these to construct interesting binary selfdual codes. In particular, we construct some extremal selfdual codes length 64 and 68, constructing 30 new extremal selfdual codes of length 68.

Bordered Constructions of SelfDual Codes from Group Rings and New Extremal Binary SelfDual CodesDougherty, 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, 20190222)We introduce a bordered construction over group rings for selfdual 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 selfdual codes of lengths 20, 32, 40, 44, 52, 56, 64, 68, 88 and best known binary selfdual codes of length 72. In particular we obtain 41 new binary extremal selfdual 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 SelfDual Codes from Group Rings and New Extremal SelfDual Binary Codes of Length 68Dougherty, Steven; Gildea, Joe; Kaya, Abidin; Korban, Adrian; University of Scranton; University of Chester; Sampoerna University ; University of Chester (American Institute of Mathematical Sciences, 20191130)We describe eight composite constructions from group rings where the orders of the groups are 4 and 8, which are then applied to find selfdual 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 selfdual binary codes of length 64. Finally, we use a buildingup method over F2 + uF2 to obtain new extremal binary selfdual codes of length 68. We construct 11 new codes via the buildingup method and 2 new codes by considering possible neighbors.

Composite Matrices from Group Rings, Composite GCodes and Constructions of SelfDual CodesDougherty, Steven; Gildea, Joe; Korban, Adrian; Kaya, Abidin; University of Scranton; University of Chester; Harmony School of Technology (Springer, 20210519)In this work, we define composite matrices which are derived from group rings. We extend the idea of Gcodes to composite Gcodes. 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 Gcode is also a composite Gcode. We also define quasicomposite Gcodes. 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 selfdual 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.

Extending an Established Isomorphism between Group Rings and a Subring of the n × n MatricesDougherty, Steven; Gildea, Joe; Korban, Adrian; University of Scranton; University of ChesterIn 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.

Gcodes over Formal Power Series Rings and Finite Chain RingsDougherty, Steven; Gildea, Joe; Korban, Adrian; University of Scranton; University of Chester (20200229)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.

GCodes, selfdual GCodes and reversible GCodes over the Ring Bj,kDougherty, Steven; Gildea, Joe; Korban, Adrian; Sahinkaya, Serap; Tarsus University; University of Chester (Springer, 20210503)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 Gcodes, selfdual Gcodes, and reversible Gcodes over this family. In particular, we show that the projection of a Gcode over Bj,k to a code over Bl,m is also a Gcode and the image under the Gray map of a selfdual Gcode is also a selfdual Gcode when the characteristic of the base field is 2. Moreover, we show that the image of a reversible Gcode under the Gray map is also a reversible G2j+kcode. 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 quasiG codes, which are the images of Gcodes under the Gray map, are also Gscodes for some s.

Group Rings, GCodes and Constructions of SelfDual and Formally SelfDual CodesDougherty, Steven; Gildea, Joe; Taylor, Rhian; Tylyshchak, Alexander; University of Scranton; University of Chester; Uzhgorod State University (Springer, 20171115)We describe Gcodes, which are codes that 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 Gcode is also a Gcode. We give constructions of selfdual and formally selfdual codes in this setting and we improve the existing construction given in [13] by showing that one of the conditions given in the theorem is unnecessary and, moreover, it restricts the number of selfdual codes obtained by the construction. We show that several of the standard constructions of selfdual codes are found within our general framework. We prove that our constructed codes must have an automorphism group that contains G as a subgroup. We also prove that a common construction technique for producing selfdual codes cannot produce the putative [72, 36, 16] Type II code. Additionally, we show precisely which groups can be used to construct the extremal Type II codes over length 24 and 48. We define quasiG codes and give a construction of these codes.

New Extremal SelfDual Binary Codes of Length 68 via Composite Construction, F2 + uF2 Lifts, Extensions and NeighborsDougherty, Steven; Gildea, Joe; Korban, Adrian; Kaya, Abidin; University of Scranton; University of Chester; University of Chester; Sampoerna Academy; (Inderscience, 20200229)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 selfdual 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 selfdual 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 selfdual codes of length 68. As a result, we obtain 28 new codes of length 68 which were not known in the literature before.

New SelfDual and Formally SelfDual Codes from Group Ring ConstructionsDougherty, Steven; Gildea, Joe; Kaya, Abidin; Yildiz, Bahattin; University of Scranton; University of Chester; Sampoerna Academy; University of Chester; Northern Arizona University (American Institute of Mathematical Sciences, 20190831)In this work, we study construction methods for selfdual and formally selfdual codes from group rings, arising from the cyclic group, the dihedral group, the dicyclic group and the semidihedral group. Using these constructions over the rings $_F2 +uF_2$ and $F_4 + uF_4$, we obtain 9 new extremal binary selfdual codes of length 68 and 25 even formally selfdual codes with parameters [72,36,14].

Quadruple Bordered Constructions of SelfDual Codes from Group RingsDougherty, Steven; Gildea, Joe; Kaya, Abidin; University of Scranton; University of Chester; Sampoerna University (Springer Verlag, 20190705)In this paper, we introduce a new bordered construction for selfdual codes using group rings. We consider constructions over the binary field, the family of rings Rk and the ring F4 + uF4. We use groups of order 4, 12 and 20. We construct some extremal selfdual codes and nonextremal selfdual codes of length 16, 32, 48, 64 and 68. In particular, we construct 33 new extremal selfdual codes of length 68.