Related papers: Encoding subshifts through sliding block codes
This paper presents, by example, an index theory appropriate to algebras without trace. Whilst we work exclusively with the Cuntz algebras the exposition is designed to indicate how to develop a general theory. Our main result is an index…
Steganography embeds secret messages in seemingly innocuous carriers for covert communication under surveillance. Current Provably Secure Steganography (PSS) schemes based on language models can guarantee computational indistinguishability…
We study the problem of embedding arbitrary $\mathbb{Z}^k$-actions into the shift action on the infinite dimensional cube $\left([0,1]^D\right)^{\mathbb{Z}^k}$. We prove that if a $\mathbb{Z}^k$-action satisfies the marker property (in…
Given an embedded smooth projective variety Y in CP^n, we show how the existence of a hypersurface with high multiplicity along Y, but of relatively low degree and log canonical near Y implies vanishing of higher cohomology for certain…
A principled procedure to infer a hierarchy of statistical distributions possessing ill-conditioned eigenstructures, from incomplete constraints, is presented. The inference process of the \textit{pdf}'s employs the Fisher information as…
We adapt arguments concerning information-theoretic convergence in the Central Limit Theorem to the case of dependent random variables under Rosenblatt mixing conditions. The key is to work with random variables perturbed by the addition of…
A complete embedding is a symplectic embedding $\iota:Y\to M$ of a geometrically bounded symplectic manifold $Y$ into another geometrically bounded symplectic manifold $M$ of the same dimension. When $Y$ satisfies an additional finiteness…
Domino tilings have been studied extensively for both their statistical properties and their dynamical properties. We construct a subshift of finite type using matching rules for several types of dominos. We combine the previous results…
In this paper, both non-mixing and mixing local minima of the entropy are analyzed from the viewpoint of blind source separation (BSS); they correspond respectively to acceptable and spurious solutions of the BSS problem. The contribution…
This paper deals with Fountain codes, and especially with their encoding matrices, which are required here to be invertible. A result is stated that an encoding matrix induces a permutation. Also, a result is that encoding matrices form a…
Fault-tolerant, error-corrected quantum computation is commonly acknowledged to be crucial to the realisation of large-scale quantum algorithms that could lead to extremely impactful scientific or commercial results. Achieving a universal…
We define a notion of entropy for an infinite family $\mathcal{C}$ of measurable sets in a probability space. We show that the mean ergodic theorem holds uniformly for $\mathcal{C}$ under every ergodic transformation if and only if…
A translation structure on a surface is an atlas of charts to the plane so that the transition functions are translations. We allow our surfaces to be non-compact and infinite genus. We endow the space of all pointed surfaces equipped with…
Fast classical processing is essential for most quantum fault-tolerance architectures. We introduce a sliding-window decoding scheme that provides fast classical processing for the surface code through parallelism. Our scheme divides the…
We show that the limit in our definition of tree shift topological entropy is actually the infimum, as is the case for both the topological and measure-theoretic entropies in the classical situation when the time parameter is $\mathbb Z$.…
We study a quantum phase transition between a phase which is topologically ordered and one which is not. We focus on a spin model, an extension of the toric code, for which we obtain the exact ground state for all values of the coupling…
Entropy and differential entropy are important quantities in information theory. A tractable extension to singular random variables-which are neither discrete nor continuous-has not been available so far. Here, we present such an extension…
A likelihood encoder is studied in the context of lossy source compression. The analysis of the likelihood encoder is based on the soft-covering lemma. It is demonstrated that the use of a likelihood encoder together with the soft-covering…
In this article we give a sufficient condition for a morphism $\varphi$ from a smooth variety $X$ to projective space, finite onto a smooth image, to be deformed to an embedding. This result puts some theorems on deformation of morphisms of…
Optimisation problems in science and engineering typically involve finding the ground state (i.e. the minimum energy configuration) of a cost function with respect to many variables. If the variables are corrupted by noise then this…