• Bulletin of the Korean Mathematical Society
• /
• v.56 no.2
• /
• pp.419-437
• /
• 2019

This paper investigates skew ${\Theta}-{\lambda}$-constacyclic codes over $R=F_0{\oplus}F_1{\oplus}{\cdots}{\oplus}F_{k-1}$, where $F{_i}^{\prime}s$ are finite fields. The structures of skew ${\lambda}$-constacyclic codes over finite commutative semi-simple rings and their duals are provided. Moreover, skew ${\lambda}$-constacyclic codes of arbitrary length are studied under a new definition. We also show that a skew cyclic code of arbitrary length over finite commutative semi-simple rings is equivalent to either a cyclic code over R or a quasi-cyclic code over R.

• Journal of the Korean Mathematical Society
• /
• v.51 no.4
• /
• pp.853-866
• /
• 2014

Constacyclic codes of length $p^s$ over $R=\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}+u^2\mathbb{F}_{p^m}$ are precisely the ideals of the ring $\frac{R[x]}{<x^{p^s}-1>}$. In this paper, we investigate constacyclic codes of length $p^s$ over R. The units of the ring R are of the forms ${\gamma}$, ${\alpha}+u{\beta}$, ${\alpha}+u{\beta}+u^2{\gamma}$ and ${\alpha}+u^2{\gamma}$, where ${\alpha}$, ${\beta}$ and ${\gamma}$ are nonzero elements of $\mathbb{F}_{p^m}$. We obtain the structures and Hamming distances of all (${\alpha}+u{\beta}$)-constacyclic codes and (${\alpha}+u{\beta}+u^2{\gamma}$)-constacyclic codes of length $p^s$ over R. Furthermore, we classify all cyclic codes of length $p^s$ over R, and by using the ring isomorphism we characterize ${\gamma}$-constacyclic codes of length $p^s$ over R.

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

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.1
• /
• pp.131-150
• /
• 2019

In this paper, we consider the structure of ${\gamma}$-constacyclic codes of length $2p^s$ over the Galois ring $GR(p^a,m)$ for any unit ${\gamma}$ of the form ${\xi}_0+p{\xi}_1+p^2z$, where $z{\in}GR(p^a,m)$ and ${\xi}_0$, ${\xi}_1$ are nonzero elements of the set ${\mathcal{T}}(p,m)$. Here ${\mathcal{T}}(p,m)$ denotes a complete set of representatives of the cosets ${\frac{GR(p^a,m)}{pGR(p^a,m)}}={\mathbb{F}}p^m$ in $GR(p^a,m)$. When ${\gamma}$ is not a square, the rings ${\mathcal{R}}_p(a,m,{\gamma})=\frac{GR(p^a,m)[x]}{{\langle}x^2p^s-{\gamma}{\rangle}}$ is a chain ring with maximal ideal ${\langle}x^2-{\delta}{\rangle}$, where ${\delta}p^s={\xi}_0$, and the number of codewords of ${\gamma}$-constacyclic code are provided. Furthermore, the self-orthogonal and self-dual ${\gamma}$-constacyclic codes of length $2p^s$ over $GR(p^a,m)$ are also established. Finally, we determine the Rosenbloom-Tsfasman (RT) distances and weight distributions of all such codes.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.4
• /
• pp.1189-1208
• /
• 2018

The aim of this paper is to study the class of ${\Lambda}$-constacyclic codes of length $2p^s$ over the finite commutative chain ring ${\mathcal{R}}_a=\frac{{\mathbb{F}_{p^m}}[u]}{{\langle}u^a{\rangle}}={\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m}+{\cdots}+u^{a-1}{\mathbb{F}}_{p^m}$, for all units ${\Lambda}$ of ${\mathcal{R}}_a$ that have the form ${\Lambda}={\Lambda}_0+u{\Lambda}_1+{\cdots}+u^{a-1}{\Lambda}_{a-1}$, where ${\Lambda}_0,{\Lambda}_1,{\cdots},{\Lambda}_{a-1}{\in}{\mathbb{F}}_{p^m}$, ${\Lambda}_0{\neq}0$, ${\Lambda}_1{\neq}0$. The algebraic structure of all ${\Lambda}$-constacyclic codes of length $2p^s$ over ${\mathcal{R}}_a$ and their duals are established. As an application, this structure is used to determine the Rosenbloom-Tsfasman (RT) distance and weight distributions of all such codes. Among such constacyclic codes, the unique MDS code with respect to the RT distance is obtained.

• Journal of the Korean Mathematical Society
• /
• v.52 no.5
• /
• pp.965-989
• /
• 2015

Let p, ${\ell}$ be distinct odd primes, q be an odd prime power with gcd(q, p) = gcd(q,${\ell}$) = 1, and m, n be positive integers. In this paper, we determine all self-dual, self-orthogonal and complementary-dual negacyclic codes of length $2p^{n{\ell}m}$ over the finite field ${\mathbb{F}}_q$ with q elements. We also illustrate our results with some examples.

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

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.3
• /
• pp.609-619
• /
• 2019

The methods for constructing quantum codes is not always sufficient by itself. Also, the constructed quantum codes as in the classical coding theory have to enjoy a quality of its parameters that play a very important role in recovering data efficiently. In a very recent study quantum construction and examples of quantum codes over a finite field of order q are presented by La Garcia in [14]. Being inspired by La Garcia's the paper, here we extend the results over a finite field with $q^2$ elements by studying necessary and sufficient conditions for constructions quantum codes over this field. We determine a criteria for the existence of $q^2$-cyclotomic cosets containing at least three elements and present a construction method for quantum maximum-distance separable (MDS) codes. Moreover, we derive a way to construct quantum codes and show that this construction method leads to quantum codes with better parameters than the ones in [14].

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.6
• /
• pp.1385-1422
• /
• 2019

Let p be an odd prime. The algebraic structure of all negacyclic codes of length $8_{p^s}$ over the finite commutative chain ring ${\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m}$ where $u^2=0$ is studied in this paper. Moreover, we classify all negacyclic codes of length $8_{p^s}$ over ${\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m}$ into 5 cases, i.e., $p^m{\equiv}1$ (mod 16), $p^m{\equiv}3$, 11 (mod 16), $p^m{\equiv}5$, 13 (mod 16), $p^m{\equiv}7$, 15 (mod 16) and $p^m{\equiv}9$ (mod 16). From that, the structures of dual and some self-dual negacyclic codes and number of codewords of negacyclic codes are obtained.