• Journal of applied mathematics & informatics
• /
• v.32 no.3_4
• /
• pp.529-537
• /
• 2014

The paper introduces a new product of polynomials defined over a field. It is a generalization of the ordinary product with inner polynomial getting non-overlapping segments obtained by multiplying with coefficients and variable with expanding powers. It has been called 'Ordered Power Product' (OPP). Considering two rings of polynomials $R_m[x]=F[x]modulox^m-1$ and $R_n[x]=F[x]modulox^n-1$, over a field F, the paper then considers the newly introduced product of the two polynomial rings. Properties and algebraic structure of the product of two rings of polynomials are studied and it is shown to be a ring. Using the new type of product of polynomials, we define a new product of two cyclic codes and devise a method of getting a cyclic code from the 'ordered power product' of two cyclic codes. Conditions for the OPP of the generators polynomials of component codes, giving a cyclic code are examined. It is shown that OPP cyclic code so obtained is more efficient than the one that can be obtained by Kronecker type of product of the same component codes.

• Korean Journal of Mathematics
• /
• v.22 no.4
• /
• pp.725-742
• /
• 2014

In this paper, we find all inequivalent classes of self-orthogonal codes over $Z_{p^2}$ of lengths $l{\leq}3$ for all primes p, using similar method as in [3]. We find that the classification of self-orthogonal codes over $Z_{p^2}$ includes the classification of all codes over $Z_p$. Consequently, we classify all the codes over $Z_p$ and self-orthogonal codes over $Z_{p^2}$ of lengths $l{\leq}3$ according to the automorphism group of each code.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.4
• /
• pp.1111-1122
• /
• 2017

In this work, we consider constacyclic and cyclic self-dual codes over the rings $R_k$. We start with theoretical existence results for constacyclic and cyclic self-dual codes of any length over $R_k$ and then construct cyclic self-dual codes over $R_1={\mathbb{F}}_2+u{\mathbb{F}}_2$ of even lengths from lifts of binary cyclic self-dual codes. We classify all free cyclic self-dual codes over $R_1$ of even lengths for which non-trivial such codes exist. In particular we demonstrate that our constructions provide a counter example to a claim made by Batoul et al. in [1] and we explain why their claim fails.

• Korean Journal of Mathematics
• /
• v.23 no.1
• /
• pp.163-169
• /
• 2015

We give idempotent generators for quadratic residue codes over p-adic integers and over the rings $\mathbb{Z}_{p^e}$.

• 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.

• Journal of the Korean Mathematical Society
• /
• v.44 no.5
• /
• pp.1139-1162
• /
• 2007

We examine the main linear coding theory problem and study the structure of optimal linear codes over the ring ${\mathbb{Z}}_m$. We derive bounds on the maximum Hamming weight of these codes. We give bounds on the best linear codes over ${\mathbb{Z}}_8$ and ${\mathbb{Z}}_9$ of lengths up to 6. We determine the minimum distances of optimal linear codes over ${\mathbb{Z}}_4$ for lengths up to 7. Some examples of optimal codes are given.

• 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.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.3
• /
• pp.915-923
• /
• 2015

Self-dual codes have been actively studied because of their connections with other mathematical areas including t-designs, invariant theory, group theory, lattices, and modular forms. We presented the building-up construction for self-dual codes over GF(q) with $q{\equiv}1$ (mod 4), and over other certain rings (see [19], [20]). Since then, the existence of the building-up construction for the open case over GF(q) with $q=p^r{\equiv}3$ (mod 4) with an odd prime p satisfying $p{\equiv}3$ (mod 4) with r odd has not been solved. In this paper, we answer it positively by presenting the building-up construction explicitly. As examples, we present new optimal self-dual [16, 8, 7] codes over GF(7) and new self-dual codes over GF(7) with the best known parameters [24, 12, 9].

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.3
• /
• pp.921-935
• /
• 2018

In this study we determine the structure of m-adic residue codes over the non-chain ring $F_q[v]/(v^2-v)$ and present some promising examples of such codes that have optimal parameters with respect to Griesmer Bound. Further, we show that the generators of m-adic residue codes serve as a natural and suitable application for generating reversible DNA codes via a special automorphism and sets over $F_{4^{2k}}[v]/(v^2-v)$.

• 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.