• 대한수학회보
• /
• 제54권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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권7호
• /
• pp.3583-3598
• /
• 2019

In order to improve the reliability and repair efficiency of distributed storage systems, minimum bandwidth regenerating (MBR) codes based on cyclic variable fractional repetition (VFR) codes are constructed in this thesis, which can repair failed nodes accurately. Specifically, in order to consider the imbalance of data accessed by the users, cyclic VFR codes are constructed according to that data with different heat degrees are copied in different repetition degrees. Moreover, we divide the storage nodes into groups, and construct MBR codes based on cyclic VFR codes to improve the file download speed. Performance analysis and simulation results show that, the repair locality of a single node failure is always 2 when MBR codes based on cyclic VFR codes are adopted in distributed storage systems, which is obviously superior to the traditional MBR codes. Compared with RS codes and simple regenerating codes, the proposed MBR codes based on cyclic VFR codes have lower repair locality, repair complexity and bandwidth overhead, as well as higher repair efficiency. Moreover, relative to FR codes, the MBR codes based on cyclic VFR codes can be applicable to more storage systems.

• Journal of applied mathematics & informatics
• /
• 제31권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.

• Journal of applied mathematics & informatics
• /
• 제36권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.

• 대한수학회보
• /
• 제56권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.

• 대한수학회보
• /
• 제60권2호
• /
• pp.443-460
• /
• 2023

A binary linear code is said to be a ℤ₂-double cyclic code if its coordinates can be partitioned into two subsets such that any simultaneous cyclic shift of the coordinates of the subsets leaves the code invariant. These codes were introduced in [6]. A ℤ₂-double cyclic code is called reversible if reversing the order of the coordinates of the two subsets leaves the code invariant. In this note, we give necessary and sufficient conditions for a ℤ₂-double cyclic code to be reversible. We also give a relation between reversible ℤ₂-double cyclic code and LCD ℤ₂-double cyclic code for the separable case and we present a few examples to show that such a relation doesn't hold in the non-separable case. Furthermore, we list examples of reversible ℤ₂-double cyclic codes of length ≤ 10.

• 대한수학회보
• /
• 제53권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.

• 대한수학회보
• /
• 제55권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.

• 대한수학회보
• /
• 제55권3호
• /
• pp.971-997
• /
• 2018

The parity of cyclotomic numbers of order 2, 4 and 6 associated with 4-cyclotomic cosets modulo an odd prime p are obtained. Hence the explicit expressions of primitive idempotents of minimal cyclic codes of length $p^n$, $n{\geq}1$ over the quaternary field $F_4$ are obtained. These codes are observed to be subcodes of Q codes of length $p^n$. Some orthogonal properties of these subcodes are discussed. The minimal cyclic codes of length 17 and 43 are also discussed and it is observed that the minimal cyclic codes of length 17 are two weight codes. Further, it is shown that a Q code of prime length is always cyclotomic like a binary duadic code and it seems that there are infinitely many prime lengths for which cyclotomic Q codes of order 6 exist.

• 대한수학회보
• /
• 제57권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.