English
Related papers

Related papers: Group Matrix Ring Codes and Constructions of Self-…

200 papers

Self-orthogonal codes have been of interest due to there rich algebraic structures and wide applications. Euclidean self-orthogonal codes have been quite well studied in literature. Here, we have focused on Hermitian self-orthogonal codes.…

Information Theory · Computer Science 2017-10-16 Somphong Jitman , Todsapol Mankean

Given a finite ring $A$ which is a free left module over a subring $R$ of $A$, two types of $R$-bases, pseudo-self-dual bases (similar to trace orthogonal bases) and symmetric bases, are defined which in turn are used to define duality…

Information Theory · Computer Science 2016-08-08 Steve Szabo , Felix Ulmer

Binary array codes are widely used in storage systems to prevent data loss, such as the Redundant Array of Independent Disks~(RAID). Most designs for such codes, such as Blaum-Roth~(BR) codes and Independent-Parity~(IP) codes, are carried…

Information Theory · Computer Science 2024-04-02 Leilei Yu , Yunghsiang S. Han , Jiasheng Yuan , Zhongpei Zhang

We construct MDS Euclidean and Hermitian self-dual codes over large finite fields of odd and even characteristics. Our codes arise from cyclic and negacyclic duadic codes.

Information Theory · Computer Science 2010-04-08 Kenza Guenda

The purpose of this paper is two-fold. First we show that Kim's building-up construction of binary self-dual codes is equivalent to Chinburg-Zhang's Hilbert symbol construction. Second we introduce a $q$-ary version of Chinburg-Zhang's…

Information Theory · Computer Science 2026-04-10 Jae-Hyun Baek , Jon-Lark Kim

In this paper, we construct MDS Euclidean self-dual codes which are extended cyclic duadic codes. And we obtain many new MDS Euclidean self-dual codes. We also construct MDS Hermitian self-dual codes from generalized Reed-Solomon codes and…

Information Theory · Computer Science 2016-06-24 Hongxi Tong , Xiaoqing Wang

In this paper, we introduce the homogeneous weight and homogeneous Gray map over the ring $R_{q}=\mathbb{F}_{2}[u_{1},u_{2},\ldots,u_{q}]/\left\langle u_{i}^{2}=0,u_{i}u_{j}=u_{j}u_{i}\right\rangle$ for $q \geq 2$. We also consider the…

Information Theory · Computer Science 2015-06-09 K. Chatouh , K. Guenda , T. A. Gulliver , L. Noui

In a group trellis, the sequence of branches that split from the identity path and merge to the identity path form two normal chains. The Schreier refinement theorem can be applied to these two normal chains. The refinement of the two…

Information Theory · Computer Science 2011-06-21 Kenneth M. Mackenthun

As a result of their applications in network coding, space-time coding, and coding for criss-cross errors, matrix codes have garnered significant attention; in various contexts, these codes have also been termed rank-metric codes,…

Information Theory · Computer Science 2015-07-21 Katherine Morrison

In this article, we construct new non-binary quantum codes from skew constacyclic codes over finite commutative non-chain ring $\mathcal{R}= \mathbb{F}_{p^m}[v]/\langle v^3 =v \rangle$ where $p$ is an odd prime and $m \geq 1$. In order to…

Information Theory · Computer Science 2020-10-15 Ram Krishna Verma , Om Prakash , Ashutosh Singh

Let $D_{2n}=\langle x,y\mid x^n=1, y^2=1, yxy=x^{-1}\rangle$ be a dihedral group, and $R={\rm GR}(p^2,m)$ be a Galois ring of characteristic $p^2$ and cardinality $p^{2m}$ where $p$ is a prime. Left ideals of the group ring $R[D_{2n}]$ are…

Information Theory · Computer Science 2016-09-15 Yonglin Cao , Yuan Cao , Fang-Wei Fu

Given a finite group $G$ and an extension of finite chain rings $S|R$, one can consider the group rings $\mathscr{S} = S[G]$ and $\mathscr{R} = R[G]$. The group ring $\mathscr{S}$ can be viewed as an $R$-bimodule, and any of its…

Information Theory · Computer Science 2025-08-12 Maryam Bajalan , Javier de la Cruz , Alexandre Fotue Tabue , Edgar Martínez-Moro

A semidualizing module is a generalization of Grothendieck's dualizing module. For a local Cohen-Macaulay ring $R$, the ring itself and its canonical module are always realized as (trivial) semidualizing modules. Reasonably, one might…

Commutative Algebra · Mathematics 2023-06-28 Ela Celikbas , Hugh Geller , Toshinori Kobayashi

For any positive integers $m$ and $k$, existing literature only determines the number of all Euclidean self-dual cyclic codes of length $2^k$ over the Galois ring ${\rm GR}(4,m)$, such as in [Des. Codes Cryptogr. (2012) 63:105--112]. Using…

Information Theory · Computer Science 2020-07-21 Yuan Cao , Yonglin Cao , San ling , Guidong Wang

We present some basic theory on the duality of codes over two non-unital rings of order $6$, namely $H_{23}$ and $H_{32}$. For a code $\mathcal{C}$ over these rings, we associate a binary code $\mathcal{C}_a$ and a ternary code…

Information Theory · Computer Science 2025-02-26 Altaf Alshuhail , Rowena Alma Betty , Lucky Galvez

Maximum Distance Separable (MDS) self-dual codes are of significant theoretical and practical importance. Generalized Reed-Solomon (GRS) codes are the most prominent MDS codes. Correspondingly there have been many research on constructions…

Information Theory · Computer Science 2026-02-09 Chun'e Zhao , Wenping Ma

In this note, an intrinsic description of some families of linear codes with symmetries is given, showing that they can be described more generally as quasi group codes, that is, as linear codes allowing a group of permutation automorphisms…

Information Theory · Computer Science 2021-11-11 Martino Borello , Wolfgang Willems

It is shown in this paper that, if $R$ is a Frobenius ring, then the quaternion ring $\mathcal{H}_{a,b}(R)$ is a Frobenius ring for all units $a,b \in R$. In particular, if $q$ is an odd prime power then $\mathcal{H}_{a,b}(\mathbb{F}_q)$ is…

Information Theory · Computer Science 2021-09-07 Pierre Lance Tan , Virgilio Sison

In this paper, we present four constructions of {general} self-orthogonal matrix-product codes associated with Toeplitz matrices. The first one relies on the {dual} of a known {general} dual-containing matrix-product code; the second one is…

Information Theory · Computer Science 2024-11-26 Yang Li , Shixin Zhu , Edgar Martínez-Moro

Let $R$ be a commutative ring with identity and let $M$ be an $R$-module which is generated by $\mu$ elements but not fewer. We denote by $\operatorname{SL}_n(R)$ the group of the $n \times n$ matrices over $R$ with determinant $1$. We…

Commutative Algebra · Mathematics 2020-12-11 Luc Guyot