English
Related papers

Related papers: Composite Matrices from Group Rings, Composite G-C…

200 papers

Let $A=\frac{\mathbb{F}[x]}{\langle f(x)\rangle }$, where $f(x)$ is a monic polynomial over a finite field $\mathbb{F}$. In this paper, we study the relation between $A$-codes and their duals. In particular, we state a counterexample and a…

Information Theory · Computer Science 2017-05-30 Ashkan Nikseresht

We construct two series of linear codes over finite ring $\mathbb{F}_{q}[x]/(x^2)$ and Galois ring $GR(p^2,m)$ respectively reaching the Griesmer bound. They derive two series of codes over finite field $\mathbb{F}_{q}$ by Gray map. The…

Information Theory · Computer Science 2016-12-06 Jin Li , Aixian Zhang , Keqin Feng

The ring of dual integers is the bounded polynomial ring $\mathbb Z[\epsilon]=\mathbb Z[T]/(T^2)$ with integer coefficients. We describe the (finitely generated) Gorenstein-projective $\mathbb Z[\epsilon]$-modules as the torsionless…

Representation Theory · Mathematics 2025-09-29 Xiu-Hua Luo , Markus Schmidmeier

Families of codes such as group codes, constacyclic and skew cyclic codes, some of which independently suggested in the literature, turn out to be special instances of the general family of crossed product codes. Hamming-metric is a main…

Rings and Algebras · Mathematics 2018-11-06 Yuval Ginosar , Aviram Rochas Moreno

Surface codes have historically been the dominant choice for quantum error correction due to their superior error threshold performance. However, recently, a new class of Generalized Bicycle (GB) codes, constructed from binary circulant…

Information Theory · Computer Science 2025-07-30 François Arnault , Philippe Gaborit , Nicolas Saussay

The structure of multivariate semisimple codes over a finite chain ring $R$ is established using the structure of the residue field $\bar R$. Multivariate codes extend in a natural way the univariate cyclic and negacyclic codes and include…

Combinatorics · Mathematics 2007-05-23 E. Martinez-Moro , I. F. Rua

Generalized quasi-cyclic (GQC) codes form a wide and useful class of linear codes that includes thoroughly quasi-cyclic codes, finite geometry (FG) low density parity check (LDPC) codes, and Hermitian codes. Although it is known that the…

Information Theory · Computer Science 2008-11-26 Vo Tam Van , Hajime Matsui , Seiichi Mita

The existence of optimal binary self-dual codes is a long-standing research problem. In this paper, we present some results concerning the decomposition of binary self-dual codes with a dihedral automorphism group $D_{2p}$, where $p$ is a…

Information Theory · Computer Science 2014-05-30 Tao Zhang , Jerod Michel , Tao Feng , Gennian Ge

We show that a unital ring is generated by its commutators as an ideal if and only if there exists a natural number $N$ such that every element is a sum of $N$ products of pairs of commutators. We show that one can take $N \leq 2$ for…

Rings and Algebras · Mathematics 2024-04-04 Eusebio Gardella , Hannes Thiel

Let $F_2$ be the binary field and $Z_{2^r}$ the residue class ring of integers modulo $2^r$, where $r$ is a positive integer. For the finite $16$-element commutative local Frobenius non-chain ring $Z_4+uZ_4$, where $u$ is nilpotent of index…

Information Theory · Computer Science 2017-11-22 Virgilio P. Sison , Monica N. Remillion

In this paper, based on the nonbinary graph state, we present a systematic way of constructing good non-binary quantum codes, both additive and nonadditive, for systems with integer dimensions. With the help of computer search, which…

Quantum Physics · Physics 2009-11-13 Dan Hu , Weidong Tang , Meisheng Zhao , Qing Chen , Sixia Yu , C. H. Oh

Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, monomials and trinomials over…

Information Theory · Computer Science 2013-10-08 Cunsheng Ding , Zhengchun Zhou

The permutation groups of cyclic codes are widely applicable in determining the weight distribution of codes, decoding theory and various other areas. In this paper, by employing two distinct matrix representations, we can relate cyclic…

Information Theory · Computer Science 2026-05-26 Junjie Huang , Jicheng Ma , Chang-An Zhao

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

In this paper, we mainly study quaternary linear codes and their binary subfield codes. First we obtain a general explicit relationship between quaternary linear codes and their binary subfield codes in terms of generator matrices and…

Information Theory · Computer Science 2022-01-03 Yansheng Wu , Chengju Li , Fu Xiao

The existence and construction of self-dual codes in a permutation module of a finite group for the semisimple case are described from two aspects, one is from the point of view of the composition factors which are self-dual modules, the…

Information Theory · Computer Science 2012-10-09 Yun Fan , Guanghui Zhang

When G is a finite abelian group, we define G-spans of groupoids and their associated matrices with entries in the group ring QG and show that composition of spans corresponds to multiplication of matrices.

Category Theory · Mathematics 2026-03-24 Joachim Kock , Jesper M. Møller

In two previous papers we constructed new families of completely regular codes by concatenation methods. Here we determine cases in which the new codes are completely transitive. For these cases we also find the automorphism groups of such…

Information Theory · Computer Science 2023-03-21 Joaquim Borges , Josep Rifà , Victor Zinoviev

In this paper, we describe a new type of DNA codes over two noncommutative rings $E$ and $F$ of order four with characteristic 2. Our DNA codes are based on quasi self-dual codes over $E$ and $F$. Using quasi self-duality, we can describe…

Information Theory · Computer Science 2021-05-17 Jon-Lark Kim , Dong Eun Ohk

We study a new class of codes over Z_2 x Z_2 which we call L-codes. They arise as a natural fifth step in a series of analogies between Kleinian codes, binary codes, lattices and vertex operator algebras. This analogy will be explained in…

Combinatorics · Mathematics 2010-08-12 Julia Galstad , Gerald Hoehn