Related papers: $\mathbb{Z}_p\mathbb{Z}_p[u]$-additive codes
We present a general theorem characterizing the relationship between the prime base $p$ representations of non-negative integers $x$ and their positive integer powers, $x^n$. For any positive integer $l$, the theorem establishes the…
In this paper we present a class of maps for which the multiplicativity of the maximal output p-norm holds when p is 2 and p is larger than or equal to 4. The class includes all positive trace-preserving maps from the matrix algebra on the…
In this study, linear codes having their Lee-weight distributions over the semi-local ring $\mathbb{F}_{q}+u\mathbb{F}_{q}$ with $u^{2}=1$ are constructed using the defining set and Gauss sums for an odd prime $q $. Moreover, we derive…
A Z2Z4-additive code C is called cyclic if the set of coordinates can be partitioned into two subsets, the set of Z_2 and the set of Z_4 coordinates, such that any cyclic shift of the coordinates of both subsets leaves the code invariant.…
The $\Z_{p^s}$-additive codes of length $n$ are subgroups of $\Z_{p^s}^n$, and can be seen as a generalization of linear codes over $\Z_2$, $\Z_4$, or $\Z_{2^s}$ in general. A $\Z_{p^s}$-linear generalized Hadamard (GH) code is a GH code…
In this paper, we construct a listing for the vertices of the augmentation graph of given size, and as a consequence, we obtain a Hamiltonian cycle for the square of the augmentation graph of given size. As applications, we have a Gray code…
Gray codes for vector spaces are considered in two graphs: the Grassmann graph, and the projective-space graph, both of which have recently found applications in network coding. For the Grassmann graph, constructions of cyclic optimal codes…
Let $p$ be an odd prime and $R$ a $p$-torsion-free commutative $\mathbb{Z}_{(p)}$-algebra. We compute the periodic cyclic homology over $R$ of the universal differential graded algebra $R//p$ which is obtained from $R$ by universally…
We fully characterize the mappings $\Phi$ that send every Pythagorean-hodograph (PH) curve to a PH curve. We prove that in any dimension, such mappings are precisely the conformal functions whose dilation is the square of a real rational…
A linear code of length $n$ over a finite chain ring $R$ with residue field $\F_q$ is a $R$-submodule of $R^n$. A $R$-linear code is a code over $\F_q$ (not necessarily linear) which is the generalized Gray map image of a linear code over…
We show that regular homogeneous two-weight $\mathbb{Z}_{p^k}$-codes where $p$ is odd and $k\geqslant 2$ with dual Hamming distance at least four do not exist. The proof relies on existence conditions for the strongly regular graph built on…
In classical coding theory, Gray isometries are usually defined as mappings between finite Frobenius rings, which include the ring $Z_m$ of integers modulo $m$, and the finite fields. In this paper, we derive an isometric mapping from $Z_8$…
In this note, we study skew cyclic and skew constacyclic codes over the ring $\mathcal{R}=F_{q}+uF_{q}+vF_{q}+uvF_{q}$ where $q=p^{m},$ $p$ is an odd prime, $u^{2}=u,~v^{2}=v,~uv=vu$. We show that Gray images of a skew cyclic and skew…
In this paper, we study dynamical properties as shadowing and structural stability for a class of dynamics on $\mathbb{Z}_p$ and $\mathbb{Q}_p$, where $p \geq 2$ is a prime number. In particular, we prove that if $f: \mathbb{Z}_p \to…
A Gray code is a listing structure for a set of combinatorial objects such that some consistent (usually minimal) change property is maintained throughout adjacent elements in the list. While Gray codes for m-ary strings have been…
Let $F_2$ be the binary field and $Z_{2^r}$ the residue class ring of integers modulo $2^r$, where $r$ is a positive integer. For the finite $16$-element commutative local Frobenius non-chain ring $Z_4+uZ_4$, where $u$ is nilpotent of index…
We study cyclic codes with arbitrary length over Fp+vFp where theta(v)=av, a in Fp and v^2=0. We characterize all existing codes in case of O(theta)|n by using certain projections from (Fp+vFp)[x;theta] to Fp[x]. We provide an explicit…
We introduce a class of metric spaces called $p$-additive combinations and show that for such spaces we may deduce information about their $p$-negative type behaviour by focusing on a relatively small collection of almost disjoint metric…
The additive codes may have better parameters than linear codes. However, it is still a challenging problem to efficiently construct additive codes that outperform linear codes, especially those with greater distances than linear codes of…
Generalized quasi-cyclic (GQC) codes with arbitrary lengths over the ring $\mathbb{F}_{q}+u\mathbb{F}_{q}$, where $u^2=0$, $q=p^n$, $n$ a positive integer and $p$ a prime number, are investigated. By the Chinese Remainder Theorem,…