Related papers: Encoding subshifts through sliding block codes

In relative entropy coding, a sender aims to design a stochastic code such that, on input $X \sim P_X$, the receiver can generate a sample $Y \sim P_{Y \mid X}$. It is a standard result that (1) this requires at least $I(X; Y)$ bits, (2)…

In this paper, we generalize the well-known index coding problem to exploit the structure in the source-data to improve system throughput. In many applications, the data to be transmitted may lie (or can be well approximated) in a…

Given a factor code $\pi$ from a one-dimensional shift of finite type $X$ onto an irreducible sofic shift $Y$, if $\pi$ is finite-to-one there is an invariant called the degree of $\pi$ which is defined the number of preimages of a typical…

Several applications in communication, control, and learning require approximating target distributions to within small informational divergence (I-divergence). The additional requirement of invertibility usually leads to using encoders…

We use entropy numbers in combination with the polynomial method to derive a new general lower bound for the n-th minimal error in the quantum setting of information-based complexity. As an application, we improve some lower bounds on…

We provide another approach to Friedland's result that the topological entropy $h$ of a symmetric nearest-neighbor subshift is computable. Instead of the previous algebraic technique, our approach is mostly combinatorial and involves only…

We prove that every $1$-error-correcting code over a finite field can be embedded in a $1$-perfect code of some larger length. Embedding in this context means that the original code is a subcode of the resulting $1$-perfect code and can be…

We study ergodic-theoretic properties of coded shift spaces. A coded shift space is defined as a closure of all bi-infinite concatenations of words from a fixed countable generating set. We derive sufficient conditions for the uniqueness of…

In this paper we present an extendible, block gluing $\mathbb Z^3$ shift of finite type $W^{\text{el}}$ in which the topological entropy equals the $L$-projectional entropy for a two-dimensional sublattice $L:=\mathbb Z \vec{e}_1+\mathbb…

Let $G,H$ be two countable amenable groups. We introduce the notion of group charts, which gives us a tool to embed an arbitrary $H$-subshift into a $G$-subshift. Using an entropy addition formula derived from this formalism we prove that…

We define an algorithm that parses multidimensional arrays sequentially into mainly unrepeated but nested multidimensional sub-arrays of increasing size, and show that the resulting sub-block pointer encoder compresses almost every…

Recently Ott, Tomforde and Willis introduced a notion of one-sided shifts over infinite alphabets and proposed a definition for sliding block codes between such shift spaces. In this work we propose a more general definition for sliding…

Information plays an important role in our understanding of the physical world. We hence propose an entropic measure of information for any physical theory that admits systems, states and measurements. In the quantum and classical world,…

We investigate uniform ergodic type theorems for additive and subadditive functions on a subshift over a finite alphabet. We show that every strictly ergodic subshift admits a uniform ergodic theorem for Banach-space-valued additive…

Quantum many-body states that frequently appear in physics often obey an entropy scaling law, meaning that an entanglement entropy of a subsystem can be expressed as a sum of terms that scale linearly with its volume and area, plus a…

This note revisits the problem of finding necessary and sufficient conditions for a subshift to have a continuous g-function. Results obtained by Krieger (IMS Lecture Notes-Monograph Series, 48, 306--316, 2006) on finite alphabet subshifts…

Let $X$ be a complex manifold, and let $Y$ and $D$ be two reduced simple-normal-crossing (snc) divisors on $X$ with no common irreducible components. Given a proper locally K\"ahler morphism $\pi \colon X \to \Delta$ from $X$ to a complex…

In this Thesis, several results in quantum information theory are collected, most of which use entropy as the main mathematical tool. *While a direct generalization of the Shannon entropy to density matrices, the von Neumann entropy behaves…

In this paper, we study the entanglement entropy in string theory in the simplest setup of dividing the nine dimensional space into two halves. This corresponds to the leading quantum correction to the horizon entropy in string theory on…

This article is about a decoding algorithm for error-correcting subspace codes. A version of this algorithm was previously described by Rosenthal, Silberstein and Trautmann. The decoding algorithm requires the code to be defined as the…