English
Related papers

Related papers: Good codes from twisted group algebras

200 papers

Group codes are right or left ideals in a group algebra of a finite group over a finite field. Following ideas of Bazzi and Mitter on group codes over the binary field, we prove that group codes over finite fields of any characteristic are…

Information Theory · Computer Science 2020-01-22 Martino Borello , Wolfgang Willems

Let $R$ be a finite commutative chain ring with unique maximal ideal $\langle \gamma\rangle$, and let $n$ be a positive integer coprime with the characteristic of $R/\langle \gamma\rangle$. In this paper, the algebraic structure of cyclic…

Information Theory · Computer Science 2014-05-13 Bocong Chen , San Ling , Guanghui Zhang

This is a manuscript of a chapter prepared for a book. The good codes possess large information length and large minimum distance. A class of codes is said to be asymptotically good if there exists a positive real $\delta$ such that, for…

Information Theory · Computer Science 2022-03-03 Yun Fan , Liren Lin

We prove that certain acyclic cluster algebras over the complex numbers are the coordinate rings of holomorphic symplectic manifolds. We also show that the corresponding quantum cluster algebras have no non-trivial prime ideals. This allows…

Quantum Algebra · Mathematics 2012-10-23 Sebastian Zwicknagl

We utilize the symmetry groups of regular tessellations on two-dimensional surfaces of different constant curvatures, including spheres, Euclidean planes and hyperbolic planes, to encode a qubit or qudit into the physical degrees of freedom…

Quantum Physics · Physics 2025-10-09 Yixu Wang , Yijia Xu , Zi-Wen Liu

In this paper, we construct several infinite families of $q$-ary constacyclic codes over a finite field $\mathbb{F}_q$ with length $n$, dimension around $n/2$, and minimum distance at least $cn/\log_q n$ for some positive constant $c$. They…

Information Theory · Computer Science 2026-05-29 Zekai Chen , Min Sha

Let $R$ be a finite commutative chain ring, $D_{2n}$ be the dihedral group of size $2n$ and $R[D_{2n}]$ be the dihedral group ring. In this paper, we completely characterize left ideals of $R[D_{2n}]$ (called left $D_{2n}$-codes) when ${\rm…

Information Theory · Computer Science 2021-05-18 H. Aghili , R. Sobhani

The aim of this paper is to give conditions for the equivalency between skew constacyclic codes, skew cyclic codes and skew negacyclic codes defined over semi-local rings. Also, we provide construction and an enumeration of Euclidean and…

Information Theory · Computer Science 2019-02-25 Ranya D. Boulanouar , Aicha Batoul

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

In this paper convolutional codes with cyclic structure will be investigated. These codes can be understood as left principal ideals in a suitable skew-polynomial ring. It has been shown in [3] that only certain combinations of the…

Rings and Algebras · Mathematics 2007-07-16 Heide Gluesing-Luerssen , Barbara Langfeld

In this paper, we study the dihedral codes, i.e. the left ideals of $\mathbb{F}_qD_{n}$ in the case $\gcd(q, n) = 1$. An explicit algebraic description of the dihedral codes and their duals is obtained. In addition, a criterion for…

Rings and Algebras · Mathematics 2021-03-02 Kirill V. Vedenev , Vladimir M. Deundyak

We introduce twisted unitary $t$-groups, a generalization of unitary $t$-groups under a twisting by an irreducible representation. We then apply representation theoretic methods to the Knill-Laflamme error correction conditions to show that…

Quantum Physics · Physics 2024-08-13 Eric Kubischta , Ian Teixeira

Constant dimension codes are subsets of the finite Grassmann variety. The study of these codes is a central topic in random linear network coding theory. Orbit codes represent a subclass of constant dimension codes. They are defined as…

Information Theory · Computer Science 2014-06-20 Joachim Rosenthal , Anna-Lena Trautmann

In this paper, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction…

Information Theory · Computer Science 2017-04-14 Lin Sok , Minjia Shi , Patrick Solé

The purpose of this article is to study constacyclic codes of length $np^s$ over $R^t:=\frac{\mathbb{F}_{p^m}[u]}{\langle u^t \rangle },$ where $t$ is a natural number and $\gcd(n,p)=1$. We give generators of all the ideals of…

Information Theory · Computer Science 2026-05-13 Akanksha Tiwari , Pramod Kanwar , Ritumoni Sarma

We investigate group coding for arbitrary finite groups acting linearly on a vector space. These yield robust codes based on real or complex matrix groups. We give necessary and sufficient conditions for correct subgroup decoding using…

Combinatorics · Mathematics 2013-11-28 Hye Jung Kim , J. B. Nation , Anne V. Shepler

In this paper, we study quasi-twisted codes and their relationship with additive constacyclic codes through a polynomial-based approach. We first present a polynomial characterization of quasi-twisted codes over finite fields analogous to…

Information Theory · Computer Science 2026-03-09 Kanat Abdukhalikov , Gyanendra K. Verma

The structures of the ideals of Clifford algebras which can be both infinite dimensional and degenerate over the real numbers are investigated.

Rings and Algebras · Mathematics 2009-02-04 Yi Ming Zou

Let $p$ be an odd prime, and let $m$ be a positive integer satisfying $p^m \equiv 3~(\text{mod }4).$ Let $\mathbb{F}_{p^m}$ be the finite field with $p^m$ elements, and let $R=\mathbb{F}_{p^m}[u]/\left<u^2\right>$ be the finite commutative…

Information Theory · Computer Science 2018-05-23 Anuradha Sharma , Saroj Rani

Finite semisimple group algebras for which all the minimal ideals are easily computable dimension (ECD) are characterized and some lower bounds for the minimum Hamming distance of group codes in these algebras are offered. Examples…

Representation Theory · Mathematics 2024-08-08 E. J. García-Claro