Related papers: Good codes from twisted group algebras
We provide a polynomial approach to investigate linear complementary dual (LCD) quasi-cyclic codes over finite fields. We establish necessary and sufficient conditions for LCD quasi-cyclic codes of index 2 with respect to the Euclidean,…
Let U be the group of units of an infinite twisted group algebra K_\lambda G over a field K. We describe the maximal FC-subgroup of U and give a characterization of U with finitely conjugacy classes. In the case of group algebras we obtain…
In this paper, necessary and sufficient conditions for the self-orthogonality of t-generator quasi-cyclic (QC) codes are presented under the Euclidean, Hermitian, and symplectic inner products, respectively. Particularly, by studying the…
Constacyclic codes over finite fields are an important class of linear codes as they contain distance-optimal codes and linear codes with best known parameters. They are interesting in theory and practice, as they have the constacyclic…
We provide isomorphism results for Hopf algebras that are obtained as graded twistings of function algebras on finite groups by cocentral actions of cyclic groups. More generally , we also consider the isomorphism problem for…
The cluster category is a triangulated category introduced for its combinatorial similarities with cluster algebras. We prove that a cluster algebra A of finite type can be realized as a Hall algebra, called the exceptional Hall algebra, of…
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…
Let $\mathbb{F}_{p^m}$ be a finite field of cardinality $p^m$, where $p$ is a prime, and $k, N$ be any positive integers. We denote $R_k=F_{p^m}[u]/\langle u^k\rangle =F_{p^m}+uF_{p^m}+\ldots+u^{k-1}F_{p^m}$ ($u^k=0$) and…
In this paper, we mainly consider quasi-cyclic (QC) codes over finite chain rings. We study module structures and trace representations of QC codes, which lead to some lower bounds on the minimum Hamming distance of QC codes. Moreover, we…
We introduce the $\ell^1$-ideal intersection property for crossed product C*-algebras. It is implied by C*-simplicity as well as C*-uniqueness. We show that topological dynamical systems of arbitrary lattices in connected Lie groups,…
It is proved in a reference (Fan, Lin, IEEE TIT, vol.67, pp.5016-5025) that the self-dual (LCD respectively) dihedral codes over a finite field~$F$ with ${|F|=q}$ are asymptotically good if $q$ is even (odd respectively). In this paper, we…
Constacyclic codes contain cyclic codes as a subclass and have nice algebraic structures. Constacyclic codes have theoretical importance, as they are connected to a number of areas of mathematics and outperform cyclic codes in several…
Let $F$ be a field with cardinality $p^\ell$ and $0\neq \lambda\in F$, and $0\le h<\ell$. Extending Euclidean and Hermitian inner products, Fan and Zhang introduced Galois $p^h$-inner product (DCC, vol.84, pp.473-492). In this paper, we…
We construct a well-behaved stable category of modules for a large class of infinite groups. We then consider its Picard group, which is the group of invertible (or endotrivial) modules. We show how this group can be calculated when the…
In this paper cyclic codes are established with respect to the Mannheim metric over some finite rings by using Gaussian integers and the decoding algorithm for these codes is given.
Multi-dimensional cyclic code is a natural generalization of cyclic code. In an earlier paper we explored two-dimensional constacyclic codes over finite fields. Following the same technique, here we characterize the algebraic structure of…
We continue our investigation of a variation of the group ring isomorphism problem for twisted group algebras. Contrary to previous work, we include cohomology classes which do not contain any cocycle of finite order. This allows us to…
This article is a survey of conjectures and results on reductive algebraic groups having good reduction at a suitable set of discrete valuations of the base field. Until recently, this subject has received relatively little attention, but…
Construction of good quantum codes via classical codes is an important task for quantum information and quantum computing. In this work, by virtue of a decomposition of the defining set of constacyclic codes we have constructed eight new…
Universal quantum computation requires the implementation of a logical non-Clifford gate. In this paper, we characterize all stabilizer codes whose code subspaces are preserved under physical $T$ and $T^{-1}$ gates. For example, this could…