English
Related papers

Related papers: Three results on twisted $G-$codes and skew twiste…

200 papers

We introduce in this article a new method to estimate the minimum distance of codes from algebraic surfaces. This lower bound is generic, i.e. can be applied to any surface, and turns out to be ``liftable'' under finite morphisms, paving…

Algebraic Geometry · Mathematics 2020-06-09 Alain Couvreur , Philippe Lebacque , Marc Perret

We construct an infinite family of two-Lee-weight and three-Lee-weight codes over the non-chain ring $\mathbb{F}_p+u\mathbb{F}_p+v\mathbb{F}_p+uv\mathbb{F}_p,$ where $u^2=0,v^2=0,uv=vu.$ These codes are defined as trace codes. They have the…

Information Theory · Computer Science 2016-12-02 Yan Liu , Minjia Shi , Patrick Solé

In this paper, we study a class of twisted generalized Reed-Solomon (TGRS) codes with general l twists. A sufficient and necessary condition for the TGRS codes to be MDS or l-MDS (l<k and l<n-k) is determined. A sufficient and necessary…

Information Theory · Computer Science 2022-11-14 Haojie Gu , Jun Zhang

We determine conditions on classical group algebra codes so that they have pre-orientation for cup products and copy-cup gates. This defines quantum codes that have constant-depth $\operatorname{CZ}$ and $\operatorname{CCZ}$ gates…

Quantum Physics · Physics 2026-02-27 Ryan Tiew , Nikolas P. Breuckmann

We study C*-irreducibility of inclusions of reduced twisted group C*-algebras and of reduced group C*-algebras. We characterize C*-irreducibility in the case of an inclusion arising from a normal subgroup, and exhibit many new examples of…

Operator Algebras · Mathematics 2023-01-31 Erik Bédos , Tron Omland

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…

Rings and Algebras · Mathematics 2023-03-17 L. Margolis , O. Schnabel

For every group genetic code with finite number of generating and at most with one defining relation we introduce the braid group of this genetic code. This construction includes the braid group of Euclidean plane, the braid groups of…

Group Theory · Mathematics 2007-05-23 Valerij G. Bardakov

The problem of computing the dimension of a left/right ideal in a group algebra F[G] of a finite group G over a field F is considered. The ideal dimension is related to the rank of a matrix originating from a regular left/right…

Information Theory · Computer Science 2019-09-09 Michele Elia , Elisa Gorla

Let $A$ be either a simplicial complex $K$ or a small category $\mathcal C$ with $V(A)$ as its set of vertices or objects. We define a twisted structure on $A$ with coefficients in a simplicial group $G$ as a function $$ \delta\colon…

Algebraic Topology · Mathematics 2015-09-23 J. Y. Li , V. V. Vershinin , J. Wu

A twisted commutative algebra is (for us) a commutative $\mathbf{Q}$-algebra equipped with an action of the infinite general linear group. In such algebras the "$\mathbf{GL}$-prime" ideals assume the duties fulfilled by prime ideals in…

Commutative Algebra · Mathematics 2020-02-05 Andrew Snowden

In this paper, we introduce a notion of stable coarse algebras for metric spaces with bounded geometry, and formulate the twisted coarse Baum--Connes conjecture with respect to stable coarse algebras. We prove permanence properties of this…

Operator Algebras · Mathematics 2026-05-05 Jintao Deng , Ryo Toyota

A (left) group code of length n is a linear code which is the image of a (left) ideal of a group algebra via an isomorphism from FG to Fn which maps G to the standard basis of Fn. Many classical linear codes have been shown to be group…

Information Theory · Computer Science 2024-02-06 José Joaquín Bernal , Ángel del Río , Juan Jacobo Simón

The intersection problem for additive (extended and non-extended) perfect codes, i.e. which are the possibilities for the number of codewords in the intersection of two additive codes C1 and C2 of the same length, is investigated. Lower and…

Information Theory · Computer Science 2022-04-26 J. Rifà , F. Solov'eva , M. Villanueva

For simple twisted group algebra over a group $G$, if $G^{\shortmid}$ is Hall subgroup of $G$ then the semi-center is simple. Simple twisted groups algebras correspond to groups of central type. We classify all groups of central type of…

Rings and Algebras · Mathematics 2016-01-26 Ofir Schnabel

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

Motivated by the studies of twisted generalized Reed-Solomon (TGRS) codes, we initiate the study of twisted elliptic curve codes (TECCs) in this paper. In particular, we study a class of TECCs with one twist. The parity-check matrices of…

Information Theory · Computer Science 2026-05-11 Xiaofeng Liu , Jun Zhang , Fang-Wei Fu

The Cayley-Dickson algebra has long been a challenge due to the lack of an explicit multiplication table. Despite being constructible through inductive construction, its explicit structure has remained elusive until now. In this article, we…

Rings and Algebras · Mathematics 2023-03-14 Guangbin Ren , Xin Zhao

In this paper, by using some properties for linear algebra methods, the parity-check matrices for twisted generalized Reed-Solomon codes with any given hook $h$ and twist $t$ are presented, and then a sufficient and necessary condition for…

Information Theory · Computer Science 2022-09-07 Canze Zhu , Qunying Liao

An $S$-ring (Schur ring) is called separable with respect to a class of $S$-rings $\mathcal{K}$ if it is determined up to isomorphism in $\mathcal{K}$ only by the tensor of its structure constants. An abelian group is said to be separable…

Combinatorics · Mathematics 2019-01-01 Grigory Ryabov

Clique-width is a well-studied graph parameter owing to its use in understanding algorithmic tractability: if the clique-width of a graph class ${\cal G}$ is bounded by a constant, a wide range of problems that are NP-complete in general…

Combinatorics · Mathematics 2021-12-23 Konrad K. Dabrowski , Matthew Johnson , Daniël Paulusma