English
Related papers

Related papers: MDS and Self-dual Codes over Rings

200 papers

In this article, we construct integrally closed modules of rank two over a two-dimensional regular local ring. The modules are explicitly constructed from a given complete monomial ideal with respect to a regular system of parameters. Then…

Commutative Algebra · Mathematics 2018-09-24 Futoshi Hayasaka

We construct a new family of quantum MDS codes from classical generalized Reed-Solomon codes and derive the necessary and sufficient condition under which these quantum codes exist. We also give code bounds and show how to construct them…

Quantum Physics · Physics 2009-11-13 Zhuo Li , Li-Juan Xing , Xin-Mei Wang

Let $p$ be an odd prime number, $\mathbb{F}_{p^m}$ be a finite field of cardinality $p^m$ and $s$ a positive integer. Using some combinatorial identities, we obtain certain properties for Kronecker product of matrices over $\mathbb{F}_p$…

Information Theory · Computer Science 2019-07-17 Yuan Cao , Yonglin Cao , Hai Q. Dinh , Somphong Jitman

The purpose of this article is to study constacyclic codes of length $np^s$ over $R^t:=\frac{\mathbb{F}_{p^m}[u]}{\langle u^t \rangle },$ where $t$ is a natural number and $\gcd(n,p)=1$. We give generators of all the ideals of…

Information Theory · Computer Science 2026-05-13 Akanksha Tiwari , Pramod Kanwar , Ritumoni Sarma

We construct codes over the ring $\mathbb{F}_2+u\mathbb{F}_2$ with $u^2=0$. These code are designed for use in DNA computing applications. The codes obtained satisfy the reverse complement constraint, the $GC$ content constraint and avoid…

Information Theory · Computer Science 2012-07-17 Kenza Guenda , T. Aaron Gulliver

In this paper, we study the theory for constructing DNA cyclic codes of odd length over $\Z_4[u]/\langle u^2 \rangle$ which play an important role in DNA computing. Cyclic codes of odd length over $\Z_4 + u \Z_4$ satisfy the reverse…

Information Theory · Computer Science 2015-08-11 Sukhamoy Pattanayak , Abhay Kumar Singh

Maximum Distance Separable (MDS) matrices play a central role in coding theory and symmetric-key cryptography due to their optimal diffusion properties. In this paper, we present a construction of MDS matrices using skew polynomial rings \(…

Information Theory · Computer Science 2026-02-03 Atif Ahmad Khan , Shakir Ali , Elif Segah Oztas , Abhishek Kesarwani

Let $\mathbb{F}_{q}$ be a finite field of cardinality $q$, $R=\mathbb{F}_{q}[u]/\langle u^4\rangle=\mathbb{F}_{q}+u\mathbb{F}_{q}+u^2\mathbb{F}_{q}+u^3\mathbb{F}_{q}$ $(u^4=0)$ which is a finite chain ring, and $n$ be a positive integer…

Information Theory · Computer Science 2015-11-10 Yuan Cao , Yonglin Cao , Jian Gao

Self-dual cyclic codes form an important class of linear codes. It has been shown that there exists a self-dual cyclic code of length $n$ over a finite field if and only if $n$ and the field characteristic are even. The enumeration of such…

Information Theory · Computer Science 2017-07-19 Supawadee Prugsapitak , Somphong Jitman

This paper provides a comprehensive analysis of almost maximum distance separable (AMDS) constacyclic codes of length $4p^{\varsigma}$ over the finite field $\mathbb{F}_{p^m}$, where $p$ is an odd prime number. Furthermore, it introduces…

Combinatorics · Mathematics 2026-05-25 Manasa K J , Divya Acharya , Prasanna Poojary

It is known that maximum distance separable and maximum distance profile convolutional codes exist over large enough finite fields of any characteristic for all parameters $(n,k,\delta)$. It has been conjectured that the same is true for…

Optimization and Control · Mathematics 2008-01-03 Ryan Hutchinson

We study the structure of linear codes over the ring $B_k$ which is defined by $\mathbb{F}_{p^r}[v_1,v_2,\ldots,v_k]/\langle v_i^2=v_i,~v_iv_j=v_jv_i \rangle_{i,j=1}^k.$ In order to study the codes, we begin with studying the structure of…

Information Theory · Computer Science 2018-01-18 Irwansyah , Djoko Suprijanto

This study aims to determine the algebraic structures of $\alpha$-constacyclic codes of length $3p^s$ over the finite commutative non-chain ring $\mathcal{R}=\frac{\mathbb{F}_{p^m}[u, v]}{\langle u^2, v^2, uv-vu\rangle}$, for a prime $p…

Combinatorics · Mathematics 2025-04-03 Divya Acharya , Prasanna Poojary , Vadiraja Bhatta G R

In this paper, we construct indecomposable integrally closed modules of arbitrary rank over a two-dimensional regular local ring. The modules are quite explicitly constructed from a given complete monomial ideal. We also give structural and…

Commutative Algebra · Mathematics 2021-12-07 Futoshi Hayasaka

Self-dual MDS and NMDS codes over finite fields are linear codes with significant combinatorial and cryptographic applications. In this paper, firstly, we investigate the duality properties of generalized twisted Reed-Solomon (abbreviated…

Information Theory · Computer Science 2022-02-24 Guanmin Guo , Ruihu Li , Yang Liu , Hao Song

In this paper, cyclic codes are established over some finite quaternion integer rings with respect to the quaternion Mannheim distance, and de- coding algorithm for these codes is given.

Information Theory · Computer Science 2010-03-24 Murat Guzeltepe , Mehmet Ozen

Constacyclic codes over finite fields are of theoretical importance as they are closely related to a number of areas of mathematics such as algebra, algebraic geometry, graph theory, combinatorial designs and number theory. However, the…

Information Theory · Computer Science 2026-05-08 Hongsheng Hu , Nian Li , Yanan Wu , Xiangyong Zeng

Constacyclic codes over finite fields are a family of linear codes and contain cyclic codes as a subclass. Constacyclic codes are related to many areas of mathematics and outperform cyclic codes in several aspects. Hence, constacyclic codes…

Information Theory · Computer Science 2022-08-29 Zhonghua Sun , Cunsheng Ding , Xiaoqiang Wang

It is known that, for transmission over quasi-static MIMO fading channels with n transmit antennas, diversity can be obtained by using an inner fully diverse space-time block code while coding gain, derived from the determinant criterion,…

Information Theory · Computer Science 2010-08-10 Frederique Oggier , Patrick Sole , Jean-Claude Belfiore

Using linear functional-based duality of modules, we generalize the syndrome decoding algorithm of linear codes over finite fields to those over finite commutative rings. Moreover, If the ring is local the algorithm is simplified by…

Information Theory · Computer Science 2014-10-14 Asmae Drhima , Mustapha Najmeddine