Related papers: Duality Preserving Gray Maps for Codes over Rings
We investigate properties which remain invariant under the action of quasi-M\"obius maps of quasi-metric spaces. A metric space is called doubling with constant D if every ball of finite radius can be covered by at most D balls of half the…
The choice of an isomorphism, a duality, between a finite abelian group $A$ and its character group allows one to define dual codes of additive codes over $A$. Properties of dualities and dual codes are studied, continuing work of Delsarte…
In this paper we describe a class of codes called {\it permutation codes}. This class of codes is a generalization of cyclic codes and quasi-cyclic codes. We also give some examples of optimal permutation codes over binary, ternary, and…
We reconsider some older constructions of T-duality, based on automorphisms of the worldsheet operator algebra, in a modern context. It has been long known that at special points in the moduli space of torus compactifications, the target…
This paper extends Auslander-Reiten duality in two directions. As an application, we obtain various criteria for freeness of modules over local rings in terms of vanishing of Ext modules, which recover a lot of known results on the…
Linear complementary dual (LCD) codes over finite fields are linear codes satisfying $C\cap C^{\perp}=\{0\}$. We generalize the LCD codes over finite fields to $\mathbb{Z}_2\mathbb{Z}_2[u]$-LCD codes over the ring…
We introduce the concept of alternate-edge-colourings for maps, and study highly symmetric examples of such maps. Edge-biregular maps of type $(k,l)$ occur as smooth normal quotients of a particular index two subgroup of $T_{k,l}$, the full…
In this paper we introduce self-dual cyclic and quantum codes over Z2^{\alpha} x (Z2 + uZ2)^{\beta}. We determine the conditions for any Z2Z2[u]-cyclic code to be self-dual, that is, C = C^{\perp}. Since the binary image of a…
This paper is an attempt to apply the tools of supergeometry to arithmetic. Supergeometric objects are defined over supercommutative rings of coefficients, and we consider an integral ring with exactly two odd variables. In this case the…
We construct MDS Euclidean and Hermitian self-dual codes over large finite fields of odd and even characteristics. Our codes arise from cyclic and negacyclic duadic codes.
In this paper, we study the codes over the matrix ring over $\mathbb{Z}_4$, which is perhaps the first time the ring structure $M_2(\mathbb{Z}_4)$ is considered as a code alphabet. This ring is isomorphic to…
As a result of their applications in network coding, space-time coding, and coding for criss-cross errors, matrix codes have garnered significant attention; in various contexts, these codes have also been termed rank-metric codes,…
Graphical models have proven to be powerful tools for representing high-dimensional systems of random variables. One example of such a model is the undirected graph, in which lack of an edge represents conditional independence between two…
We present an algebraic framework which simultaneously generalizes the notion of linear subspaces, matroids, valuated matroids, and oriented matroids. We call the resulting objects matroids over hyperfields. In fact, there are (at least)…
The ring of dual numbers over a ring $R$ is $R[\alpha] = R[x]/(x^2)$, where $\alpha$ denotes $x+(x^2)$. For any finite commutative ring $R$, we characterize null polynomials and permutation polynomials on $R[\alpha]$ in terms of the…
Classical primal-dual affine programming takes place over finite dimensional real vector spaces. This results in beautiful duality theory, connecting the optimal solu- tions of the primal maximization problem and the dual minimization…
The barcode of a persistence module serves as a complete combinatorial invariant of its isomorphism class. Barcodes are typically extracted by performing changes of basis on a persistence module until the constituent matrices have a special…
Many two-dimensional classical field theories have hidden symmetries that form an infinite-dimensional algebra. For those examples that correspond to effective descriptions of compactified superstring theories, the duality group is expected…
After recalling the definition of codes as modules over skew polynomial rings, whose multiplication is defined by using an automorphism and a derivation, and some basic facts about them, in the first part of this paper we study some of…
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].…