English
Related papers

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

200 papers

Let $\mathbb{Z}_p$ be the ring of integers modulo a prime number $p$ where $p-1$ is a quadratic residue modulo $p$. This paper presents the study of constacyclic codes over chain rings $\mathcal{R}=\frac{\mathbb{Z}_p[u]}{\langle…

Information Theory · Computer Science 2022-12-27 Indibar Debnath , Ashutosh Singh , Om Prakash , Abdollah Alhevaz

In this paper, the cyclic codes of length $n$, where $n$ is odd with certain restrictions, over a finite chain ring $R$, have been studied using the structure of group algebra approach. The primitive idempotents of $RG$ of a finite cyclic…

Rings and Algebras · Mathematics 2025-09-22 Seema Antil , Gurleen Kaur , Manju Khan

The main result here is a characterisation of binary $2$-neighbour-transitive codes with minimum distance at least $5$ via their minimal subcodes, which are found to be generated by certain designs. The motivation for studying this class of…

Combinatorics · Mathematics 2018-07-27 Daniel R. Hawtin , Cheryl E. Praeger

Let R > S be finite Frobenius rings for which there exists a trace map T from R onto S as left S modules. Let C:= {x -> T(ax + bf(x)) : a,b in R}. Then C is an S-linear subring-subcode of a left linear code over R. We consider functions f…

Rings and Algebras · Mathematics 2011-01-10 Eimear Byrne

For a commutative finite $\mathbb{Z}$-algebra, i.e., for a commutative ring $R$ whose additive group is finitely generated, it is known that the group of units of $R$ is finitely generated, as well. Our main results are algorithms to…

Commutative Algebra · Mathematics 2025-06-18 Martin Kreuzer , Florian Walsh

We show that there are good long binary generalized quasi-cyclic self-dual (either Type I or Type II) codes.

Information Theory · Computer Science 2016-01-12 MinJia Shi , Yan Liu , Patrick Solé

Linear codes with a few weights have many nice applications including combinatorial design, distributed storage system, secret sharing schemes and so on. In this paper, we construct two families of linear codes with a few weights based on…

Information Theory · Computer Science 2022-10-12 Ziling Heng , Xinran Wang , Xiaoru Li

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

Coding Theory where the alphabet is identified with the elements of a ring or a module has become an important research topic over the last 30 years. Such codes over rings had important applications and many interesting mathematical…

Information Theory · Computer Science 2021-03-17 Niklas Gassner , Marcus Greferath , Joachim Rosenthal , Violetta Weger

This article studies one-generator and two-generator quasi-cyclic codes over finite fields. We present two versions of necessary and sufficient conditions for the symplectic selforthogonality of one-generator quasi-cyclic codes, using both…

Information Theory · Computer Science 2024-12-19 Tushar Bag , Hai Q Dinh , Daniel Panario

New families of unit memory as well as multi-memory convolutional codes are constructed algebraically in this paper. These convolutional codes are derived from the class of group character codes. The proposed codes have basic generator…

Information Theory · Computer Science 2013-08-13 Giuliano G. La Guardia

Self-dual codes over $\Z_2\times\Z_4$ are subgroups of $\Z_2^\alpha \times\Z_4^\beta$ that are equal to their orthogonal under an inner-product that relates to the binary Hamming scheme. Three types of self-dual codes are defined. For each…

Information Theory · Computer Science 2009-10-19 J. Borges , S. T. Dougherty , C. Fernandez-Cordoba

A linear code with parameters $[n, k, n - k + 1]$ is called maximum distance separable (MDS), and one with parameters $[n, k, n - k]$ is called almost MDS (AMDS). A code is near-MDS (NMDS) if both it and its dual are AMDS. NMDS codes…

Combinatorics · Mathematics 2026-04-07 Hengfeng Liu , Chunming Tang , Zhengchun Zhou , Dongchun Han , Hao Chen

Four circulant codes form a special class of $2$-generator, index $4$, quasi-cyclic codes. Under some conditions on their generator matrices they can be shown to be self-dual. Artin primitive root conjecture shows the existence of an…

Information Theory · Computer Science 2017-09-25 Minjia Shi , Hongwei Zhu , Patrick Sole

In this paper, a virus optimization algorithm, which is one of the metaheuristic optimization technique, is employed for the first time to the problem of finding extremal binary self-dual codes. We present a number of generator matrices of…

Information Theory · Computer Science 2021-03-16 Adrian Korban , Serap Sahinkaya , Deniz Ustun

We describe the additive structure of the graded ring $\widetilde{M}_*$ of quasimodular forms over any discrete and cocompact group $\Gamma \subset \rm{PSL}(2, \RM).$ We show that this ring is never finitely generated. We calculate the…

Number Theory · Mathematics 2019-08-23 Najib Ouled Azaiez

In this paper, we propose a sufficient condition for a family of 2-generator self-orthogonal quasi-cyclic codes with respect to Hermitian inner product. Supported in the Hermitian construction, we show algebraic constructions of good…

Information Theory · Computer Science 2025-11-25 Liangdong Lu , Gaochi Zhang , Ganyu Feng , Wenzheng Ma

Skew polynomial rings over finite fields ([7] and [10]) and over Galois rings ([8]) have been used to study codes. In this paper, we extend this concept to finite chain rings. Properties of skew constacyclic codes generated by monic right…

Information Theory · Computer Science 2010-10-04 Somphong Jitman , San Ling , Patanee Udomkavanich

Let $M_n(\mathbb{Z})$ the ring of $n$-by-$n$ matrices with integral entries, and $n \geq 2$. This paper studies the set $G_n(\mathbb{Z})$ of pairs $(A,B) \in M_n(\mathbb{Z})^2$ generating $M_n(\mathbb{Z})$ as a ring. We use several…

Rings and Algebras · Mathematics 2007-07-30 B. V. Petrenko , S. N. Sidki

For a left coherent ring A with every left ideal having a countable set of generators, we show that the coderived category of left A-modules is compactly generated by the bounded derived category of finitely presented left A-modules…

Category Theory · Mathematics 2017-03-21 Leonid Positselski