• Journal of applied mathematics & informatics
• /
• v.36 no.5_6
• /
• pp.359-368
• /
• 2018

In this paper, we investigate quasi-cyclic codes over the ring $R={\mathbb{F}}_2+v{\mathbb{F}}_2$, where $v^2=v$. We investigate the structure of generators for one-generator quasi-cyclic codes over R and their minimal spanning sets. Moreover, we find the rank and a lower bound on minimum distances of free quasi-cyclic codes over R. Further, we find a relationship between cyclic codes over a different ring and quasi-cyclic codes of index 2 over R.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.679-687
• /
• 2005

In this paper we shall give a new definition for a quasi-power module P(M) and discuss some properties for P(M). The quasi-power module P(M) is a direct sum of invertible quasi-submodules C(H)'s of P(M) and then the quasi-submodule C(H) is also a direct sum of strongly cyclic quasi-submodules of C(H). When M is a quasi-perfect right R-module, we shall see that the quasi-power module P(M) is invertible.

• Structural Engineering and Mechanics
• /
• v.37 no.3
• /
• pp.267-283
• /
• 2011

Although earthquakes generate random cyclic lateral loading on structures, a quasi-static cyclic loading pattern with gradually increasing amplitude has been commonly used in the laboratory tests because of its relatively low cost and simplicity compared with pseudo-dynamic and shake table tests. The number, amplitudes and sequence of cycles must be chosen appropriately as important parameters of a quasi-static cyclic loading pattern in order to account for cumulative damage matter. This paper aims to reach a new cyclic displacement pattern to be used in quasi-static tests of well-confined, flexure-dominated reinforced concrete (RC) columns. The main parameters of the study are sectional dimensions, percentage of longitudinal reinforcement, axial force intensity and earthquake types, namely, far-fault and near-fault.

• Bulletin of the Korean Mathematical Society
• /
• v.57 no.2
• /
• pp.459-479
• /
• 2020

In the last two decades, codes over noncommutative rings have been one of the main trends in coding theory. Due to the fact that noncommutativity brings many challenging problems in its nature, still there are many open problems to be addressed. In 2015, generator polynomial matrices and parity-check polynomial matrices of generalized quasi-cyclic (GQC) codes were investigated by Matsui. We extended these results to the noncommutative case. Exploring the dual structures of skew constacyclic codes, we present a direct way of obtaining parity-check polynomials of skew multi-twisted codes in terms of their generators. Further, we lay out the algebraic structures of skew multipolycyclic codes and their duals and we give some examples to illustrate the theorems.

• Structural Engineering and Mechanics
• /
• v.23 no.2
• /
• pp.129-145
• /
• 2006

This paper provides an insight into the response of non-seismic reinforced concrete (RC) building frames to excitations of different frequencies through experimental investigation. The results of cyclic loading tests of six full-scale RC beam-column sub-assemblies are presented. The tested specimens did not have any transverse reinforcement inside the joint core, and they were subjected to quasi-static and dynamic loading with frequencies as high as 20 Hz. Some important differences between the cyclic responses of non-seismic and ductile RC frames are highlighted. The effect of excitation frequency on the behavior of non-seismic joints is also discussed. In the quasi-static tests, shear deformation of the joint panel accounted for more than 50% of the applied story drift. The test results also showed that higher-frequency excitations are less detrimental than quasi-static cyclic loads, and non-seismic frames can withstand a higher load and a larger deformation when they are applied faster.

• Communications of the Korean Mathematical Society
• /
• v.38 no.4
• /
• pp.1271-1280
• /
• 2023

The object of the present paper is to introduce a type of non-flat Riemannian manifold, called a weakly cyclic generalized B-symmetric manifold (W CGBS)_n. We obtain a sufficient condition for a weakly cyclic generalized B-symmetric manifold to be a generalized quasi Einstein manifold. Next we consider conformally flat weakly cyclic generalized B-symmetric manifolds. Then we study Einstein (W CGBS)_n (n > 2). Finally, it is shown that the semi-symmetry and Weyl semi-symmetry are equivalent in such a manifold.

• Journal of applied mathematics & informatics
• /
• v.31 no.3_4
• /
• pp.337-342
• /
• 2013

In this paper, we study a special class of linear codes, called skew cyclic codes, over the ring $R=F_p+vF_p$, where $p$ is a prime number and $v^2=v$. We investigate the structural properties of skew polynomial ring $R[x,{\theta}]$ and the set $R[x,{\theta}]/(x^n-1)$. Our results show that these codes are equivalent to either cyclic codes or quasi-cyclic codes. Based on this fact, we give the enumeration of distinct skew cyclic codes over R.

• Communications of the Korean Mathematical Society
• /
• v.23 no.3
• /
• pp.413-420
• /
• 2008

The object of the present paper is to study some properties of a quasi Einstein manifold. A non-trivial concrete example of a quasi Einstein manifold is also given.

• Journal of Communications and Networks
• /
• v.12 no.5
• /
• pp.406-410
• /
• 2010

This paper presents an approach to the construction of non-binary quasi-cyclic (QC) low-density parity-check (LDPC) codes based on multiplicative groups over one Galois field GF(q) and Euclidean geometries over another Galois field GF($2^S$). Codes of this class are shown to be regular with girth $6{\leq}g{\leq}18$ and have low densities. Finally, simulation results show that the proposed codes perform very wel with the iterative decoding.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.11
• /
• pp.36-42
• /
• 2010

This paper presents a hybrid approach to the construction of quasi-cyclic (QC) low-density parity-check (LDPC) codes based on parallel bundles in Euclidean geometries and circulant permutation matrices. Codes constructed by this method are shown to be regular with large girth and low density. Simulation results show that these codes perform very well with iterative decoding and achieve reasonably large coding gains over uncoded system.