Related papers: A duality for nonabelian group codes
We derive the gravity duals of noncommutative gauge theories from the Yang-Baxter sigma model description of the AdS_5xS^5 superstring with classical r-matrices. The corresponding classical r-matrices are 1) solutions of the classical…
The Tits alternative states that a finitely generated matrix group either contains a nonabelian free subgroup $F_2$, or it is virtually solvable. This paper considers two decision problems in virtually solvable matrix groups: the Identity…
We define generalized Hamming weights for almost affine codes. We show how various aspects and applications of generalized Hamming weights for linear codes, such as Wei duality, generalized Kung's bound, profiles, connection to wire-tap…
We revisit non-Abelian T-duality for non-semisimple groups, where it is well-known that a mixed gravitational-gauge anomaly leads to $\sigma$-models that are scale, but not Weyl-invariant. Taking into account the variation of a non-local…
In this paper, we introduce a new definitions of the Gray weight and the Gray map for linear codes over $\mathbb{Z}_9+u\mathbb{Z}_9$ with $u^2=u$. Some results on self-dual codes over this ring are investigated. Further, the structural…
In this paper, we study one-Lee weight and two-Lee weight codes over $\mathbb{Z}_{2}\mathbb{Z}_{2}[u]$, where $u^{2}=0$. Some properties of one-Lee weight $\mathbb{Z}_{2}\mathbb{Z}_{2}[u]$-additive codes are given, and a complete…
In this paper we begin the systematic study of group equations with abelian predicates in the main classes of groups where solving equations is possible. We extend the line of work on word equations with length constraints, and more…
Upper bounds are given for the weight distribution of binary weakly self-dual codes. To get these new bounds, we introduce a novel method of utilizing unitary operations on Hilbert spaces. This method is motivated by recent progress on…
Classical invariant theory of a complex reflection group $W$ highlights three beautiful structures: -- the $W$-invariant polynomials constitute a polynomial algebra, over which -- the $W$-invariant differential forms with polynomial…
We shortly present two small results regarding the study formal duality in finite abelian groups as introduced by Cohn, Kumar, Reiher and Sch\"urmann. In particular, we give a new example of a formally self dual set in…
In this notebook, I present duality theory (or theories) of abelian groups with some categorical and categorical topological flavour. I consider writing this notebook as a longer-term project, and its current content and presentation is…
We provide a combinatorial construction for linear codes attaining the maximum possible number of distinct weights. We then introduce the related problem of determining the existence of linear codes with an arbitrary number of distinct…
Zeta functions for linear codes were defined by Iwan Duursma in 1999. They were generalized to the case of some invariant polynomials by the preset author. One of the most important problems is whether extremal weight enumerators satisfy…
Recently, the weight distributions of the duals of the cyclic codes with two zeros have been obtained for several cases. In this paper we solve one more special case. The problem of finding the weight distribution is transformed into a…
Past few years have seen an extensive use of high-density RAM chips with wide I/O data (e.g., 16, 32, 64 bits) in computer memory systems. These chips are highly vulnerable to a special type of byte error, called an $m$-spotty byte error,…
Group network codes are a generalization of linear codes that have seen several studies over the last decade. When studying network codes, operations performed at internal network nodes called local encoding functions, are of significant…
By bivariate irreducible representations of ${\rm Sp}(2r)$, we mean irreducible representations with highest weights containing at most two nonzero entries, using the usual identification of dominant weights for complex symplectic Lie…
Linear codes with a few weights can be applied to secrete sharing, authentication codes, association schemes and strongly regular graphs. For an odd prime power $q$, we construct a class of three-weight $\F_q$-linear codes from quadratic…
A fundamental property of codes, the second-order weight distribution, is proposed to solve the problems such as computing second moments of weight distributions of linear code ensembles. A series of results, parallel to those for weight…
It is known that if every group satisfying an identity of the form yx ~ xU(x,y)y is abelian, so is every semigroup that satisfies that identity. Because a group has an identity element and the cancellation property, it is easier to show…