• 충청수학회지
• /
• 제33권2호
• /
• pp.255-270
• /
• 2020

We studied the MDS self-dual codes over finite chain rings. We stated the projection and lifting of codes over the finite chain rings with respect to the MDS self-dual codes, and then we applied the results to the MDS self-dual codes over Galois rings.

• Journal of applied mathematics & informatics
• /
• 제30권5_6호
• /
• pp.821-827
• /
• 2012

In this paper, we prove that for all odd prime powers $q$ there exist MDS(maximum distance separable) self-dual codes over $\mathbb{F}_{q^2}$ for all even lengths up to $q+1$. Additionally, we prove that there exist MDS self-dual codes of length four over $\mathbb{F}_q$ for all $q$ > 2, $q{\neq}5$.

• 대한수학회보
• /
• 제59권6호
• /
• pp.1557-1565
• /
• 2022

In this paper, Glift codes, generalized lifted polynomials, matrices are introduced. The advantage of Glift code is "distance preserving" over the ring R. Then optimal codes can be obtained over the rings by using Glift codes and lifted polynomials. Zero divisors are classified to satisfy "distance preserving" for codes over non-chain rings. Moreover, Glift codes apply on MDS codes and MDS codes are obtained over the ring 𝓡 and the non-chain ring 𝓡_e,s.

• 대한수학회지
• /
• 제47권6호
• /
• pp.1167-1182
• /
• 2010

We study codes meeting a generalized version of the Singleton bound for higher weights. We show that some of the higher weight enumerators of these codes are uniquely determined. We give the higher weight enumerators for MDS codes, the Simplex codes, the Hamming codes, the first order Reed-Muller codes and their dual codes. For the putative [72, 36, 16] code we find the i-th higher weight enumerators for i = 12 to 36. Additionally, we give a version of the generalized Singleton bound for non-linear codes.

• Journal of Applied and Pure Mathematics
• /
• 제4권3_4호
• /
• pp.211-219
• /
• 2022

We study MDS(maximum distance separable) self-dual codes over Galois ring R = GR(2^m, r). We prove that there exists an MDS self-dual code over R of length n if (n - 1) divides (2^r - 1), and 2^m divides n. We also provide the current state of the problem for the existence of MDS self-dual codes over Galois rings.

• Journal of Communications and Networks
• /
• 제13권4호
• /
• pp.393-399
• /
• 2011

We evaluate the link-level performance of cooperative multi-hop relaying networks with an maximum distance separable (MDS) code. The effect of the code on the link-level performance at the destination is investigated in terms of the outage probability and the spectral efficiency. Assuming a simple topology, we construct an absorbing Markov chain. Numerical results indicate that significant improvement can be achieved by incorporating an MDS code. MDS codes successfully facilitate recovery of the message block at a relaying node due to powerful error-correcting capability, so that it can reduce the outage probability. Furthermore, we evaluate the average number of hops where the message block can be delivered.

• 충청수학회지
• /
• 제36권3호
• /
• pp.181-194
• /
• 2023

Let GR(2^m, r) be a Galois ring with even characteristic. We are interested in the existence of MDS(Maximum Distance Separable) self-dual codes over GR(2^m, r). In this paper, we prove that there exists an MDS self-dual code over GR(2^m, r) with parameters [n, n/2, n/2 + 1] if (n - 1) | (2^r - 1) and 8 | n.

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

• Korean Journal of Mathematics
• /
• 제9권2호
• /
• pp.129-131
• /
• 2001

Let $q=p^{e1}_1{\cdots}p^{em}_m$ be the product of distinct prime elements. In this short paper, we show that the largest value of M such that there exists an ($n$, M, $n-1$) $q$-ary code is $q^2$ if $n-1{\leq}p^{ei}_i$ for all $i$.

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