English
Related papers

Related papers: Self-Dual Codes over $\mathbb{Z}_2\times (\mathbb{…

200 papers

A ${\mathbb{Z}}_2{\mathbb{Z}}_4$-additive code ${\cal C}\subseteq{\mathbb{Z}}_2^\alpha\times{\mathbb{Z}}_4^\beta$ is called cyclic if the set of coordinates can be partitioned into two subsets, the set of ${\mathbb{Z}}_2$ and the set of…

Discrete Mathematics · Computer Science 2016-05-20 Joaquim Borges , Cristina Fernández-Córdoba , Roger Ten-Valls

In this note, we demonstrate that every binary doubly even self-dual code of length $40$ can be realized as the residue code of some extremal Type II $\mathbb{Z}_4$-code. As a consequence, it is shown that there are at least $94356$…

Combinatorics · Mathematics 2017-06-13 Masaaki Harada

A kind of self-dual quasi-abelian codes of index $2$ over any finite field $F$ is introduced. By counting the number of such codes and the number of the codes of this kind whose relative minimum weights are small, such codes are proved to…

Information Theory · Computer Science 2021-08-18 Liren Lin , Yun Fan

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

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

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

In this work, we study codes over the ring R_{k,m}=F_2[u,v]/<u^{k},v^{m},uv-vu>, which is a family of Frobenius, characteristic 2 extensions of the binary field. We introduce a distance and duality preserving Gray map from R_{k,m} to…

Information Theory · Computer Science 2014-06-06 Nesibe Tufekci , Bahattin Yildiz

We investigate linear codes over the ring $\mathbb{Z}_4 + u\mathbb{Z}_4 + v\mathbb{Z}_4 + w\mathbb{Z}_4 + uv\mathbb{Z}_4 + uw\mathbb{Z}_4 + vw\mathbb{Z}_4 + uvw\mathbb{Z}_4$, with conditions $u^2=u$, $v^2=v$, $w^2=w$, $uv=vu$, $uw=wu$ and…

Information Theory · Computer Science 2019-04-26 Bustomi , Aditya Purwa Santika , Djoko Suprijanto

$(1+pw)$-constacyclic codes of arbitrary length over the non-principal ideal ring $\mathbb{Z}_{p^s} +u\mathbb{Z}_{p^s}$ are studied, where $p$ is a prime, $w\in \mathbb{Z}_{p^s}^{\times}$ and $s$ an integer satisfying $s\geq 2$. First, the…

Information Theory · Computer Science 2017-03-03 Yuan Cao , Yonglin Cao

Linear codes are considered over the ring $\mathbb{Z}_4+v\mathbb{Z}_4$, where $v^2=v$. Gray weight, Gray maps for linear codes are defined and MacWilliams identity for the Gray weight enumerator is given. Self-dual codes, construction of…

Information Theory · Computer Science 2015-01-05 Jian Gao , Yun Gao , Fang-Wei Fu

We construct an infinite family of two-Lee-weight and three-Lee-weight codes over the non-chain ring $\mathbb{F}_p+u\mathbb{F}_p+v\mathbb{F}_p+uv\mathbb{F}_p,$ where $u^2=0,v^2=0,uv=vu.$ These codes are defined as trace codes. They have the…

Information Theory · Computer Science 2016-12-02 Yan Liu , Minjia Shi , Patrick Solé

Let $\mathbb{F}_{p^m}$ be a finite field of cardinality $p^m$ and $R=\mathbb{F}_{p^m}[u]/\langle u^2\rangle=\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$ $(u^2=0)$, where $p$ is an odd prime and $m$ is a positive integer. For any $\alpha,\beta\in…

Information Theory · Computer Science 2015-11-11 Yuan Cao , Qingguo Li

In the present paper we study the structure of cyclic DNA codes of even lenght over the ring $\mathbb{F}_2+u\mathbb{F}_2+u^2\mathbb{F}_2$ where $u^3=0$. We investigate two presentations of cyclic codes of even lenght over…

Information Theory · Computer Science 2016-03-21 Hojjat Mostafanasab , Ahmad Yousefian Darani

We introduce an altered version of the four circulant construction over group rings for self-dual codes. We consider this construction over the binary field, the rings F_2 + uF_2 and F_4 + uF_4; using groups of order 3, 7, 9, 13, and 15.…

Combinatorics · Mathematics 2019-12-30 Joe Gildea , Abidin Kaya , Alexander Tylyshchak , Bahattin Yildiz

Let $R=\mathbb{F}_2+u\mathbb{F}_2+u^2\mathbb{F}_2$ be a non-chain finite commutative ring, where $u^3=u$. In this paper, we mainly study the construction of quantum codes from cyclic codes over $R$. We obtained self-orthogonal codes over…

Information Theory · Computer Science 2016-01-13 Sukhamoy Pattanayak , Abhay Kumar Singh , Pratyush Kumar

This work introduces a decoding strategy for binary self-dual codes possessing an automorphism of a specific type. The proposed algorithm is a hard decision iterative decoding scheme. The enclosed experiments show that the new decoding…

Information Theory · Computer Science 2021-06-22 Radinka Yorgova

In the field of algebraic geometric codes (AG codes), the characterization of dual codes has long been a challenging problem which relies on differentials. In this paper, we provide some descriptions for certain differentials utilizing…

Information Theory · Computer Science 2025-01-29 Puyin Wang , Jinquan Luo

Let $m\geq 2$ be any natural number and let $\mathcal{R}=\mathbb{F}_{p}+u\mathbb{F}_{p}+u^2\mathbb{F}_{p}+\cdots+u^{m-1}\mathbb{F}_{p}$ be a finite non-chain ring, where $u^m=u$ and $p$ is a prime congruent to $1$ modulo $(m-1)$. In this…

Number Theory · Mathematics 2016-09-27 Mokshi Goyal , Madhu Raka

MDS self-dual codes over finite fields have attracted a lot of attention in recent years by their theoretical interests in coding theory and applications in cryptography and combinatorics. In this paper we present a series of MDS self-dual…

Information Theory · Computer Science 2019-11-14 Aixian Zhang , Keqin Feng

Sum-rank codes are an important class of codes which can be utilized for linear network coding, space-time coding and distributed storage. They can not only reduce the size of network alphabet but also detect and correct more errors. Based…

Information Theory · Computer Science 2025-10-14 Qingfeng Xia , Hongwei Liu , Hao Chen , Xu Pan