Related papers: Mixing coded systems
We show that topological mixing, weak mixing and total transitivity are equivalent for coded systems. We provide an example of a mixing coded system which cannot be approximated by any increasing sequence of mixing shifts of finite type,…
We present an inequality that classifies mixed multipartite systems of an arbitrary dimension with respect to separability and positivity of partial transpose properties. This inequality gives a way to experimentally classify the observed…
Semiconstrained systems were recently suggested as a generalization of constrained systems, commonly used in communication and data-storage applications that require certain offending subsequences be avoided. In an attempt to apply…
Recently, two stronger versions of dynamical properties have been introduced and investigated: strong topological transitivity, which is a stronger version of the topological transitivity property, and hypermixing, which is a stronger…
We will show that a system is synchronized if and only if it has a cover whose cover map is semi-open. Also, any factor code on an irreducible sofic shift is semi-open and the image of a synchronized system by a semi-open code is…
In this paper, we introduce a standard generator matrix for mixed-alphabet linear codes over finite chain rings. Furthermore, we show that, when one has a linear complementary pair (LCP) of mixed-alphabet linear codes, both codes are…
Mixed state can be used in dense coding. We have analyzed here that maximally entangled mixed states like Werner state is dense codeable for a certain range of state parameter whereas for some wider range of the state parameter the state is…
We give an example of a dynamical system which is mixing relative to one of its factors, but for which relative mixing of order three does not hold.
We consider a distributed source coding system in which several observations are communicated to the decoder using limited transmission rate. The observations must be separately coded. We introduce a robust distributed coding scheme which…
This paper considers the egodicity properties in iterated function systems. First, we will introduce chain mixing and chain transitive iterated function systems then some results and examples are presented to compare with these notions in…
For different classes of measure preserving transformations, we investigate collections of sets that exhibit the property of lightly mixing. Lightly mixing is a stronger property than topological mixing, and requires that a lim inf is…
P systems are computing conceptual computing devices that are at least as powerful as Turing machines. However, until recently it was not known how one can encode any recursive function as a P~system. Here we propose a new encoding of…
We consider extensions of the notion of topological transitivity for a dynamical system $(X,f)$. In addition to chain transitivity, we define strong chain transitivity and vague transitivity. Associated with each there is a notion of…
We study mixing properties of generalized $T, T^{-1}$ transformation. We discuss two mixing mechanisms. In the case the fiber dynamics is mixing, it is sufficient that the driving cocycle is small with small probability. In the case the…
This paper is devoted to studying the multiple recurrent property of topologically mildly mixing systems along generalized polynomials. We show that if a minimal system is topologically mildly mixing, then it is mild mixing of higher orders…
The degree of mixing is a fundamental property of a dynamical system. General multi-dimensional shifts cannot be systematically determined. This work introduces constructive and systematic methods for verifying the degree of mixing, from…
We provide necessary and sufficient conditions for separability of mixed states. As a result we obtain a simple criterion of separability for $2\times2$ and $2\times3$ systems. Here, the positivity of the partial transposition of a state is…
Given a parity-check matrix $H_m$ of a $q$-ary Hamming code, we consider a partition of the columns into two subsets. Then, we consider the two codes that have these submatrices as parity-check matrices. We say that anyone of these two…
Let $X$ be a continuous-time strongly mixing or weakly dependent process and $T$ a renewal process independent of $X$ with inter-arrival times $\tau$. We show general conditions under which the sampled process $(X_{T_i},T_i-T_{i-1})^{\top}$…
Via (C,F)-construction we produce a 2-fold simple mixing transformation which has uncountably many non-trivial proper factors and all of them are prime.