Now showing items 1-20 of 195

• #### Composite Matrices from Group Rings, Composite G-Codes and Constructions of Self-Dual Codes

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.
• #### G-Codes, self-dual G-Codes and reversible G-Codes over the Ring Bj,k

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.
• #### Self-Dual Codes using Bisymmetric Matrices and Group Rings

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.
• #### 2^n Bordered Constructions of Self-Dual codes from Group Rings

Self-dual 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 self-dual codes. In this paper, we introduce a new bordered construction over group rings for self-dual codes by combining many of the previously used techniques. The purpose of this is to construct self-dual codes that were missed using classical construction techniques by constructing self-dual 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 self-dual codes. In particular, we construct some extremal self-dual codes length 64 and 68, constructing 30 new extremal self-dual codes of length 68.
• #### An analysis of the L1 scheme for stochastic subdiffusion problem driven by integrated space-time white noise

We consider the strong convergence of the numerical methods for solving stochastic subdiffusion problem driven by an integrated space-time white noise. The time fractional derivative is approximated by using the L1 scheme and the time fractional integral is approximated with the Lubich's first order convolution quadrature formula. We use the Euler method to approximate the noise in time and use the truncated series to approximate the noise in space. The spatial variable is discretized by using the linear finite element method. Applying the idea in Gunzburger \et (Math. Comp. 88(2019), pp. 1715-1741), we express the approximate solutions of the fully discrete scheme by the convolution of the piecewise constant function and the inverse Laplace transform of the resolvent related function. Based on such convolution expressions of the approximate solutions, we obtain the optimal convergence orders of the fully discrete scheme in spatial multi-dimensional cases by using the Laplace transform method and the corresponding resolvent estimates.
• #### New binary self-dual codes via a generalization of the four circulant construction

In this work, we generalize the four circulant construction for self-dual codes. By applying the constructions over the alphabets $\mathbb{F}_2$, $\mathbb{F}_2+u\mathbb{F}_2$, $\mathbb{F}_4+u\mathbb{F}_4$, we were able to obtain extremal binary self-dual codes of lengths 40, 64 including new extremal binary self-dual codes of length 68. More precisely, 43 new extremal binary self-dual codes of length 68, with rare new parameters have been constructed.
• #### Higher Order Time Stepping Methods for Subdiffusion Problems Based on Weighted and Shifted Grünwald–Letnikov Formulae with Nonsmooth Data

Two higher order time stepping methods for solving subdiffusion problems are studied in this paper. The Caputo time fractional derivatives are approximated by using the weighted and shifted Gr\"unwald-Letnikov formulae introduced in Tian et al. [Math. Comp. 84 (2015), pp. 2703-2727]. After correcting a few starting steps, the proposed time stepping methods have the optimal convergence orders $O(k^2)$ and $O(k^3)$, respectively for any fixed time $t$ for both smooth and nonsmooth data. The error estimates are proved by directly bounding the approximation errors of the kernel functions. Moreover, we also present briefly the applicabilities of our time stepping schemes to various other fractional evolution equations. Finally, some numerical examples are given to show that the numerical results are consistent with the proven theoretical results.
• #### A Modified Bordered Construction for Self-Dual Codes from Group Rings

We describe a bordered construction for self-dual codes coming from group rings. We apply the constructions coming from the cyclic and dihedral groups over several alphabets to obtain extremal binary self-dual codes of various lengths. In particular we find a new extremal binary self-dual code of length 78.
• #### Finite-time blow-up of a non-local stochastic parabolic problem

The main aim of the current work is the study of the conditions under which (finite-time) blow-up of a non-local stochastic parabolic problem occurs. We first establish the existence and uniqueness of the local-in-time weak solution for such problem. The first part of the manuscript deals with the investigation of the conditions which guarantee the occurrence of noise-induced blow-up. In the second part we first prove the $C^{1}$-spatial regularity of the solution. Then, based on this regularity result, and using a strong positivity result we derive, for first in the literature of SPDEs, a Hopf's type boundary value point lemma. The preceding results together with Kaplan's eigenfunction method are then employed to provide a (non-local) drift term induced blow-up result. In the last part of the paper, we present a method which provides an upper bound of the probability of (non-local) drift term induced blow-up.
• #### G-codes over Formal Power Series Rings and Finite Chain Rings

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.
• #### New Extremal Self-Dual Binary Codes of Length 68 via Composite Construction, F2 + uF2 Lifts, Extensions and Neighbors

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.
• #### Modified Quadratic Residue Constructions and New Exermal Binary Self-Dual Codes of Lengths 64, 66 and 68

In this work we consider modiﬁed versions of quadratic double circulant and quadratic bordered double circulant constructions over the binary ﬁeld and the rings F2 +uF2 and F4 +uF4 for diﬀerent prime values of p. Using these constructions with extensions and neighbors we are able to construct a number of extremal binary self-dual codes of diﬀerent lengths with new parameters in their weight enumerators. In particular we construct 2 new codes of length 64, 4 new codes of length 66 and 14 new codes of length 68. The binary generator matrices of the new codes are available online at [8].
• #### High‐order ADI orthogonal spline collocation method for a new 2D fractional integro‐differential problem

We use the generalized L1 approximation for the Caputo fractional deriva-tive, the second-order fractional quadrature rule approximation for the inte-gral term, and a classical Crank-Nicolson alternating direction implicit (ADI)scheme for the time discretization of a new two-dimensional (2D) fractionalintegro-differential equation, in combination with a space discretization by anarbitrary-order orthogonal spline collocation (OSC) method. The stability of aCrank-Nicolson ADI OSC scheme is rigourously established, and error estimateis also derived. Finally, some numerical tests are given
• #### Constructing Self-Dual Codes from Group Rings and Reverse Circulant Matrices

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.
• #### The diffusion-driven instability and complexity for a single-handed discrete Fisher equation

For a reaction diffusion system, it is well known that the diffusion coefficient of the inhibitor must be bigger than that of the activator when the Turing instability is considered. However, the diffusion-driven instability/Turing instability for a single-handed discrete Fisher equation with the Neumann boundary conditions may occur and a series of 2-periodic patterns have been observed. Motivated by these pattern formations, the existence of 2-periodic solutions is established. Naturally, the periodic double and the chaos phenomenon should be considered. To this end, a simplest two elements system will be further discussed, the flip bifurcation theorem will be obtained by computing the center manifold, and the bifurcation diagrams will be simulated by using the shooting method. It proves that the Turing instability and the complexity of dynamical behaviors can be completely driven by the diffusion term. Additionally, those effective methods of numerical simulations are valid for experiments of other patterns, thus, are also beneficial for some application scientists.
• #### Composite Constructions of Self-Dual Codes from Group Rings and New Extremal Self-Dual Binary Codes of Length 68

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.
• #### Developing A High-performance Liquid Chromatography Method for Simultaneous Determination of Loratadine and its Metabolite Desloratadine in Human Plasma.

In this work, we study construction methods for self-dual and formally self-dual codes from group rings, arising from the cyclic group, the dihedral group, the dicyclic group and the semi-dihedral group. Using these constructions over the rings $_F2 +uF_2$ and $F_4 + uF_4$, we obtain 9 new extremal binary self-dual codes of length 68 and 25 even formally self-dual codes with parameters [72,36,14].