English
Related papers

Related papers: Self-dual codes with group actions and invariants

200 papers

We introduce a new construction, the isotropy groupoid, to organize the orbit data for split $\Gamma$-spaces. We show that equivariant principal $G$-bundles over split $\Gamma$-CW complexes $X$ can be effectively classified by means of…

Geometric Topology · Mathematics 2013-02-12 Ian Hambleton , Jean-Claude Hausmann

Special functions, coding theory and $t$-designs have close connections and interesting interplay. A standard approach to constructing $t$-designs is the use of linear codes with certain regularity. The Assmus-Mattson Theorem and the…

Information Theory · Computer Science 2019-07-31 Chunming Tang , Cunsheng Ding , Maosheng Xiong

In this paper we study invariant rings arising in the study of finite dimensional algebraic structures. The rings we encounter are graded rings of the form $K[U]^{\Gamma}$ where $\Gamma$ is a product of general linear groups over a field…

Representation Theory · Mathematics 2019-07-31 Ehud Meir , with an appendix by Dejan Govc

Kitaev's quantum double models in 2D provide some of the most commonly studied examples of topological quantum order. In particular, the ground space is thought to yield a quantum error-correcting code. We offer an explicit proof that this…

Abelian codes and complementary dual codes form important classes of linear codes that have been extensively studied due to their rich algebraic structures and wide applications. In this paper, a family of abelian codes with complementary…

Information Theory · Computer Science 2017-10-16 Arunwan Boripan , Somphong Jitman , Patanee Udomkavanich

There are exactly two non-commutative rings of size $4$, namely, $E = \langle a, b ~\vert ~ 2a = 2b = 0, a^2 = a, b^2 = b, ab= a, ba = b\rangle$ and its opposite ring $F$. These rings are non-unital. A subset $D$ of $E^m$ is defined with…

Information Theory · Computer Science 2023-09-20 Vidya Sagar , Ritumoni Sarma

We provide a description of certain invariance properties of completely bounded bimodule maps in terms of their symbols. If $\mathbb{G}$ is a locally compact quantum group, we characterise the completely bounded…

Operator Algebras · Mathematics 2019-01-29 M. Alaghmandan , I. G. Todorov , L. Turowska

Let $RG$ denote the group ring of the torsion group $G$ over a commutative ring $R$ with identity. In this paper we present proofs of some statements that appear without to be proved in the literature. We establish the valid implications…

Rings and Algebras · Mathematics 2022-12-02 Brayan S. Flórez-Burbano , Alexander Holguín-Villa , John H. Castillo

In \cite{shi2022few-weight}, Shi and Li studied $\mathcal{C}_D$-codes over the ring $\mathcal{R}:=\mathbb{F}_2[x,y]/\langle x^2, y^2, xy-yx\rangle$ and their binary Gray images, where $D$ is derived using certain simplicial complexes. We…

Information Theory · Computer Science 2025-10-13 Ankit Yadav , Ritumoni Sarma , Anuj Kumar Bhagat

In this article, part of the author's thesis, we propose a definition for measured quantum groupoid. The aim is the construction of objects with duality including both quantum groups and groupoids. We base ourselves on J. Kustermans and S.…

Operator Algebras · Mathematics 2007-05-23 Franck Lesieur

We describe an attempt to make quantum K-theory (of stable maps) more amenable to the self-duality/rigidity arguments of arXiv:1512.07363 in quasimap theory, by twisting the virtual structure sheaf. For $\mathbb{P}^n$ this twist produces…

Algebraic Geometry · Mathematics 2019-06-27 Henry Liu

The weight generating functions associated with convolutional codes (CCs) are based on state space realizations or the weight adjacency matrices (WAMs). The MacWilliams identity for CCs on the WAMs was first established by Gluesing-…

Information Theory · Computer Science 2016-08-18 Ching-Yi Lai , Min-Hsiu Hsieh , Hsiao-feng Lu

Motivated by the works of Shiromoto [3] and Shi et al. [4], we study the existence of MacWilliams type identities with respect to Lee and Euclidean weight enumerators for linear codes over $\mathbb{Z}_{\ell}.$ Necessary and sufficient…

Information Theory · Computer Science 2016-07-15 Yongsheng Tang , Shixin Zhu , Xiaoshan Kai

In this paper we study codes where the alphabet is a finite Frobenius bimodule over a finite ring. We discuss the extension property for various weight functions. Employing an entirely character-theoretic approach and a duality theory for…

Information Theory · Computer Science 2016-11-14 Heide Gluesing-Luerssen , Tefjol Pllaha

Let $K$ be a commutative ring with unit and $S$ an inverse semigroup. We show that the semigroup algebra $KS$ can be described as a convolution algebra of functions on the universal \'etale groupoid associated to $S$ by Paterson. This…

Rings and Algebras · Mathematics 2009-03-23 Benjamin Steinberg

Linear codes over finite rings become one of hot topics in coding theory after Hommons et al.([4], 1994) discovered that several remarkable nonlinear binary codes with some linear-like properties are the images of Gray map of linear codes…

Information Theory · Computer Science 2016-03-08 Aixian Zhang , Jin Li , Keqin Feng

Let $q$ be an odd prime power and let $X(m,q)$ be the set of symmetric bilinear forms on an $m$-dimensional vector space over $\mathbb{F}_q$. The partition of $X(m,q)$ induced by the action of the general linear group gives rise to a…

Combinatorics · Mathematics 2014-10-28 Kai-Uwe Schmidt

In the present paper, we provide results that relate the Jacobi polynomials in genus $g$. We show that if a code is $t$-homogeneous that is, the codewords of the code for every given weight hold a $t$-design, then its Jacobi polynomial in…

Combinatorics · Mathematics 2025-02-13 Himadri Shekhar Chakraborty , Nur Hamid , Tsuyoshi Miezaki , Manabu Oura

The results of [1,2] on linear homogeneous two-weight codes over finite Frobenius rings are exended in two ways: It is shown that certain non-projective two-weight codes give rise to strongly regular graphs in the way described in [1,2].…

Combinatorics · Mathematics 2014-01-30 Thomas Honold

Classes of self-dual codes and dual-containing codes are constructed. The codes are obtained within group rings and, using an isomorphism between group rings and matrices, equivalent codes are obtained in matrix form. Distances and other…

Information Theory · Computer Science 2007-11-27 Ted Hurley