English
Related papers

Related papers: Good codes from twisted group algebras

200 papers

Generalizing Euclidean inner product and Hermitian inner product, we introduce Galois inner products, and study the Galois self-dual constacyclic codes in a very general setting by a uniform method. The conditions for existence of Galois…

Information Theory · Computer Science 2015-12-24 Yun Fan , Liang Zgang

Constacyclic codes are important classes of linear codes that have been applied to the construction of quantum codes. Six new families of asymmetric quantum codes derived from constacyclic codes are constructed in this paper. Moreover, the…

Information Theory · Computer Science 2014-04-01 Liqi Wang , Shixin Zhu

In this paper we give the structure of constacyclic codes over formal power series and chain rings. We also present necessary and sufficient conditions on the existence of MDS codes over principal ideal rings. These results allow for the…

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

We generalize the notion of cyclic codes by using generator polynomials in (non commutative) skew polynomial rings. Since skew polynomial rings are left and right euclidean, the obtained codes share most properties of cyclic codes. Since…

Rings and Algebras · Mathematics 2016-08-16 Delphine Boucher , Willi Geiselmann , Félix Ulmer

In this paper, we study the complementary dual codes in more general setting (which are called Galois LCD codes) by a uniform method. A necessary and sufficient condition for linear codes to be Galois LCD codes is determined, and…

Information Theory · Computer Science 2017-05-03 Xiusheng Liu , Yun Fan , Hualu Liu

We focus on two aspects of cyclic orbit codes: invariants under equivalence and quasi-optimality. Regarding the first aspect, we establish a connection between the codewords of a cyclic orbit code and a certain linear set on the projective…

Information Theory · Computer Science 2025-01-08 Chiara Castello , Heide Gluesing-Luerssen , Olga Polverino , Ferdinando Zullo

In this paper, we clarify some aspects on LCD codes in the literature. We first prove that a non-free LCD code does not exist over finite commutative Frobenius local rings. We then obtain a necessary and sufficient condition for the…

Information Theory · Computer Science 2019-01-31 Sanjit Bhowmick , Alexandre Fotue-Tabue , Edgar Martínez-Moro , Ramakrishna Bandi , Satya Bagchi

A finite group with a cyclic normal subgroup N such that G/N is cyclic is said to be metacyclic. A code over a finite field F is a metacyclic code if it is a left ideal in the group algebra FG for G a metacyclic group. Metacyclic codes are…

Information Theory · Computer Science 2019-06-19 Martino Borello , Pieter Moree , Patrick Solé

In this paper we introduce the notion of $\lambda$-constacyclic codes over finite rings $R$ for arbitary element $\lambda$ of $R$. We study the non-invertible-element constacyclic codes (NIE-constacyclic codes) over finite principal ideal…

Information Theory · Computer Science 2020-11-25 Hongwei Liu , Jingge Liu

A method for finding an optimum $n$-dimensional commutative group code of a given order $M$ is presented. The approach explores the structure of lattices related to these codes and provides a significant reduction in the number of…

Information Theory · Computer Science 2013-03-26 Cristiano Torezzan , João E. Strapasson , Sueli I. R. Costa , Rogerio M. Siqueira

Bazzi and Mitter [3] showed that binary dihedral group codes are asymptotically good. In this paper we prove that the dihedral group codes over any finite field with good mathematical properties are asymptotically good. If the…

Information Theory · Computer Science 2021-07-05 Yun Fan , Liren Lin

Additive cyclic codes over Galois rings were investigated in previous works. In this paper, we investigate the same problem but over a more general ring family, finite commutative chain rings. When we focus on non-Galois finite commutative…

Information Theory · Computer Science 2017-01-25 Edgar Martínez-Moro , Kamil Otal , Ferruh Özbudak

Let $\mathbb{F}_{2^m}$ be a finite field of cardinality $2^m$, $\lambda$ and $k$ be integers satisfying $\lambda,k\geq 2$ and denote $R=\mathbb{F}_{2^m}[u]/\langle u^{2\lambda}\rangle$. Let $\delta,\alpha\in \mathbb{F}_{2^m}^{\times}$. For…

Information Theory · Computer Science 2019-05-10 Yuan Cao , Yonglin Cao , Hai Q. Dinh , Songsak Sriboonchitta , Guidong Wang

We describe the Poisson ideals and attached symplectic geometry of a cluster algebra with compatible Poisson structure. We apply these results to determine the spectrum of a quantum cluster algebra. As an application, we describe the…

Quantum Algebra · Mathematics 2012-11-01 Sebastian Zwicknagl

Let $R$ be a commutative local finite ring. In this paper, we construct the complete set of pairwise orthogonal primitive idempotents of $R[X]/<g>$ where $g$ is a regular polynomial in $R[X]$. We use this set to decompose the ring…

Information Theory · Computer Science 2019-08-21 Mohammed Elhassani Charkani , Joël Kabore

In this paper we solve an open question formulated in the original paper of twisted skew group codes regarding when a twisted skew group code is checkable. Also, we prove that all ideals of dimension 3 over a twisted group algebra are…

Algebraic Geometry · Mathematics 2026-02-05 Alvaro Otero Sanchez

In this paper, we study convolutional codes with a specific cyclic structure. By definition, these codes are left ideals in a certain skew polynomial ring. Using that the skew polynomial ring is isomorphic to a matrix ring we can describe…

Information Theory · Computer Science 2007-08-13 Heide Gluesing-Luerssen , Fai-Lung Tsang

This article examines group ring codes over finite fields and finite groups. We also present a section on two-dimensional cyclic codes in the quotient ring $\mathbb{F}_q[x, y] / \langle x^{l} - 1, y^{m} - 1 \rangle$. These two-dimensional…

Information Theory · Computer Science 2025-04-22 Kanat Abdukhalikov , Tushar Bag , Daniel Panario

Cyclic codes and their various generalizations, such as quasi-twisted (QT) codes, have a special place in algebraic coding theory. Among other things, many of the best-known or optimal codes have been obtained from these classes. In this…

Information Theory · Computer Science 2017-01-05 Nuh Aydin , Ajdin Halilovic

In this paper, we define Abelian and consta-Abelian polyadic codes over rings defined as affine algebras over chain rings. For that aim, we use the classical construction via splittings and multipliers of the underlying Abelian group. We…

Information Theory · Computer Science 2023-01-02 Gülsüm Gözde Yılmazgüç , Javier de la Cruz , Edgar Martínez-Moro