• Journal of the Chungcheong Mathematical Society
• /
• v.16 no.1
• /
• pp.61-71
• /
• 2003

We obtain a necessary condition for splitting T-space off a space in terms of cyclic maps, and also obtain a necessary condition for splitting co-T-spaces in terms of cocyclic maps.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.6
• /
• pp.1617-1628
• /
• 2016

In this paper, we extend the results given in [3] to a nonchain ring $R_p={\mathbb{F}}_p+v{\mathbb{F}}_p+{\cdots}+v^{p-1}{\mathbb{F}}_p$, where $v^p=v$ and p is a prime. We determine the structure of the cyclic codes of arbitrary length over the ring $R_p$ and study the structure of their duals. We classify cyclic codes containing their duals over $R_p$ by giving necessary and sufficient conditions. Further, by taking advantage of the Gray map ${\pi}$ defined in [4], we give the parameters of the quantum codes of length pn over ${\mathbb{F}}_p$ which are obtained from cyclic codes over $R_p$. Finally, we illustrate the results by giving some examples.

• Journal of Computing Science and Engineering
• /
• v.8 no.4
• /
• pp.187-198
• /
• 2014

In this paper an efficient image encryption scheme based on cyclic rotations and multiple blockwise diffusions with two chaotic maps is proposed. A Sin map is used to generate round keys for the encryption/decryption process. A Pomeau-Manneville map is used to generate chaotic values for permutation, pixel value rotation and diffusion operations. The encryption scheme is composed of three stages: permutation, pixel value rotation and diffusion. The permutation stage performs four operations on the image: row shuffling, column shuffling, cyclic rotation of all the rows and cyclic rotation of all the columns. This stage reduces the correlation significantly among neighboring pixels. The second stage performs circular rotation of pixel values twice by scanning the image horizontally and vertically. The amount of rotation is based on $M{\times}N$ chaotic values. The last stage performs the diffusion four times by scanning the image in four different ways: block of $8{\times}8$ pixels, block of $16{\times}16$ pixels, principal diagonally, and secondary diagonally. Each of the above four diffusions performs the diffusion in two directions (forwards and backwards) with two previously diffused pixels and two chaotic values. This stage makes the scheme resistant to differential attacks. The security and performance of the proposed method is analyzed systematically by using the key space, entropy, statistical, differential and performance analysis. The experimental results confirm that the proposed method is computationally efficient with high security.

• Journal of the Korean Mathematical Society
• /
• v.58 no.3
• /
• pp.571-595
• /
• 2021

In this paper we study the algebraic structure of ℤ_pℤ_p[u]/k>-cyclic codes, where u^k = 0 and p is a prime. A ℤ_pℤ_p[u]/k>-linear code of length (r + s) is an R_k-submodule of ℤ^r_p × R^s_k with respect to a suitable scalar multiplication, where R_k = ℤ_p[u]/k>. Such a code can also be viewed as an R_k-submodule of ℤ_p[x]/r - 1> × R_k[x]/s - 1>. A new Gray map has been defined on ℤ_p[u]/k>. We have considered two cases for studying the algebraic structure of ℤ_pℤ_p[u]/k>-cyclic codes, and determined the generator polynomials and minimal spanning sets of these codes in both the cases. In the first case, we have considered (r, p) = 1 and (s, p) ≠ 1, and in the second case we consider (r, p) = 1 and (s, p) = 1. We have established the MacWilliams identity for complete weight enumerators of ℤ_pℤ_p[u]/k>-linear codes. Examples have been given to construct ℤ_pℤ_p[u]/k>-cyclic codes, through which we get codes over ℤ_p using the Gray map. Some optimal p-ary codes have been obtained in this way. An example has also been given to illustrate the use of MacWilliams identity.

• Journal of applied mathematics & informatics
• /
• v.34 no.5_6
• /
• pp.397-404
• /
• 2016

In this work, a method is given to construct quantum codes from cyclic codes over F₄ + vF₄ which will be denoted as R throughout the paper, where v² = v and a Gray map is defined between R and where F₄ is the field with 4 elements. Some optimal quantum code parameters and others will be presented at the end of the paper.

• 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 the Korea Society for Simulation
• /
• v.21 no.2
• /
• pp.79-90
• /
• 2012

In this paper, a feature signal extraction method is proposed in order to enhance the low performance of fault detection caused by unbalanced data which denotes the situations when severe disparity exists between the numbers of class instances. Most of the cyclic signals gathered during the process are recognized as normal, while only a few signals are regarded as fault; the majorities of cyclic signals data are unbalanced data. SOM(Self-Organizing Map)-based feature signal extraction method is considered to fix the adverse effects caused by unbalanced data. The weight neurons, mapped to the every node of SOM grid, are extracted as the feature signals of both class data which are used as a reference data set for fault detection. kNN(k-Nearest Neighbor) and SVM(Support Vector Machine) are considered to make fault detection models with comparisons to Hotelling's $T^2$ Control Chart, the most widely used method for fault detection. Experiments are conducted by using simulated process signals which resembles the frequent cyclic signals in semiconductor manufacturing.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.1
• /
• pp.115-137
• /
• 2018

Let $R_{u{^2},v^2,w^2,p}$ be a finite non chain ring ${\mathbb{F}}_p[u,v,w]{\langle}u^2,\;v^2,\;w^2,\;uv-vu,\;vw-wv,\;uw-wu{\rangle}$, where p is a prime number. This ring is a part of family of Frobenius rings. In this paper, we explore the structures of cyclic codes over the ring $R_{u{^2},v^2,w^2,p}$ of arbitrary length. We obtain a unique set of generators for these codes and also characterize free cyclic codes. We show that Gray images of cyclic codes are 8-quasicyclic binary linear codes of length 8n over ${\mathbb{F}}_p$. We also determine the rank and the Hamming distance for these codes. At last, we have given some examples.

• Honam Mathematical Journal
• /
• v.32 no.1
• /
• pp.45-51
• /
• 2010

Let A be an abelian variety defined over a number field K and let L be a cyclic extension of K with Galois group G = <${\sigma}$> of order n. Let III(A/K) and III(A/L) denote, respectively, the Tate-Shafarevich groups of A over K and of A over L. Assume III(A/L) is finite. Let M(x) be a companion matrix of 1+x+${\cdots}$+$x^{n-1}$ and let $A^x$ be the twist of $A^{n-1}$ defined by $f^{-1}{\circ}f^{\sigma}$ = M(x) where $f:A^{n-1}{\rightarrow}A^x$ is an isomorphism defined over L. In this paper we compute [III(A/K)][III($A^x$/K)]/[III(A/L)] in terms of cohomology, where [X] is the order of an finite abelian group X.

• Communications of the Korean Mathematical Society
• /
• v.21 no.1
• /
• pp.185-191
• /
• 2006

This paper observes that the induced homomorphisms on cohomology groups by a cyclic map are trivial. For a CW-complex X, we use the fact to obtain some conditions of X so that the n-th Gottlieb group $G_n(X)$ is trivial for an even positive integer n. As corollaries, for any positive integer m, we obtain $G_{2m}(S^{2m})\;=\;0\;and\;G_2(CP^m)\;=\;0$ which are due to D. H. Gottlieb and G. Lang respectively, where $S^{2m}$ is the 2m- dimensional sphere and $CP^m$ is the complex projective m-space. Moreover, we show that $G_4(HP^m)\;=\;0\;and\;G_8(II)\;=\;0,\;where\;HP^m$ is the quaternionic projective m-space for any positive integer m and II is the Cayley projective space.