• Journal of the Korean Mathematical Society
• /
• v.44 no.3
• /
• pp.697-706
• /
• 2007

In [8], we showed that any ideal of $\mathbb{Z}_4[X]/(X^{2^n}-1)$ is generated by at most two polynomials of the standard forms. The purpose of this paper is to find a description of the cyclic codes of even length over $\mathbb{Z}_4$ namely the ideals of $\mathbb{Z}_4[X]/(X^l\;-\;1)$, where $l$ is an even integer.

• Korean Journal of Mathematics
• /
• v.20 no.4
• /
• pp.525-532
• /
• 2012

We study the extended quadratic residue code of length 24 over $\mathbb{Z}_3$ and its lifts to rings $\mathbb{Z}_{3^e}$ for all e including 3-adic integers ring. We completely determine the weight enumerators of all these lifts.

• Communications of the Korean Mathematical Society
• /
• v.28 no.1
• /
• pp.39-54
• /
• 2013

The purpose of this paper is to find a description of the cyclic codes of length $2^n$ over $\mathbb{Z}_4$. We show that any ideal of $\mathbb{Z}_4$[X]/($X^{2n}$ - 1) is generated by at most two polynomials of the standard forms. We also find an explicit description of their duals in terms of the generators.

• Bulletin of the Korean Mathematical Society
• /
• v.43 no.4
• /
• pp.723-735
• /
• 2006

In [2] it was shown that a 1-generator quasi-cyclic code C of length n = ml of index l over $\mathbb{Z}_4$ is free if C is generated by a polynomial which divides $X^m-1$. In this paper, we prove that a necessary and sufficient condition for a cyclic code over $\mathbb{Z}_pk$ of length m to be free is that it is generated by a polynomial which divides $X^m-1$. We also show that this can be extended to finite local rings with a principal maximal ideal.

• Communications of the Korean Mathematical Society
• /
• v.26 no.3
• /
• pp.427-443
• /
• 2011

In [6, 8], we showed that any ideal of $\mathbb{Z}_4[X]/(X^l\;-\;1)$ is generated by at most two polynomials of the `standard' forms when l is even. The purpose of this paper is to find the `standard' generators of the cyclic codes over $\mathbb{Z}_{p^a}$ of length a multiple of p, namely the ideals of $\mathbb{Z}_{p^a}[X]/(X^l\;-\;1)$ with an integer l which is a multiple of p. We also find an explicit description of their duals in terms of the generators when a = 2.

• Journal of the Korean Mathematical Society
• /
• v.59 no.1
• /
• pp.193-204
• /
• 2022

We present construction methods for free self-orthogonal (self-dual or Type II) codes over ℤ₄[v]/〈v² + 2v〉 which is one of the finite commutative local non-chain Frobenius rings of order 16. By considering their Gray images on ℤ₄, we give a construct method for a code over ℤ₄. We have some new and optimal codes over ℤ₄ with respect to the minimum Lee weight or minimum Euclidean weight.

• Bulletin of the Korean Mathematical Society
• /
• v.43 no.3
• /
• pp.487-497
• /
• 2006

The purpose of this paper is to describe the structure of the rings $\mathbb{Z}_{p^2}[X]/({\alpha}(X))$ with ${\alpha}(X)$ a monic polynomial and $\={X}^{\kappa}=0$ for some nonnegative integer ${\kappa}$. Especially we will see that any ideal of such rings can be generated by at most two elements of the special form and we will find the 'minimal' set of generators of the ideals. We indicate how to identify the isomorphism types of the ideals as $\mathbb{Z}_{p^2}-modules$ by finding the isomorphism types of the ideals of some particular ring. Also we will find the annihilators of the ideals by finding the most 'economical' way of annihilating the generators of the ideal.

• The Bulletin of The Korean Astronomical Society
• /
• v.44 no.1
• /
• pp.79.1-79.1
• /
• 2019

We present an algorithm for the fast computation of the general N-point spatial correlation functions of any discrete point set embedded within an Euclidean space of ${\mathbb{R}}n$. Utilizing the concepts of kd-trees and graph databases, we describe how to count all possible N-tuples in binned configurations within a given length scale, e.g. all pairs of points or all triplets of points with side lengths < rmax. Through benchmarking we show the computational advantage of our new graph-based algorithm over more traditional methods. We show that all 3-point configurations up to and beyond the Baryon Acoustic Oscillation scale (~200 Mpc in physical units) can be performed on current Sloan Digital Sky Survey (SDSS) data in reasonable time. Finally we present the first measurements of the 4-point correlation function of ~0.5 million SDSS galaxies over the redshift range 0.43< z <0.7. We present the publicly available code GRAMSCI (GRAph Made Statistics for Cosmological Information; bitbucket.org/csabiu/gramsci), under a GNU General Public License.