Related papers: Encoding subshifts through sliding block codes
In this paper we prove an explicit matching theorem for some Hecke elements in the case of (possibly ramified) cyclic base change for general linear groups over local fields of characteristic zero with odd residue characteristic under a…
Braiding defects in topological stabiliser codes has been widely studied as a promising approach to fault-tolerant quantum computing. We present a no-go theorem that places very strong limitations on the potential of such schemes for…
We prove that for any infinite countable amenable group $G$, any $\epsilon > 0$ and any finite subset $K\subset G$, there exists a tiling (partition of $G$ into finite "tiles" using only finitely many "shapes"), where all the tiles are $(K;…
In this paper we construct a subclass of the composite access structure introduced by Mart\'inez et al. based on schemes realizing the structure given by the set of codewords of minimal support of linear codes. This class enlarges the…
A binary string transmitted via a memoryless i.i.d. deletion channel is received as a subsequence of the original input. From this, one obtains a posterior distribution on the channel input, corresponding to a set of candidate…
A theory for thermodynamic induction (TI) under isothermal conditions is presented. This includes a treatment of the Helmholtz free energy budget available for a gate variable to utilize towards aiding another variable's approach towards…
Two generalizations of the Hartmann--Tzeng (HT) bound on the minimum distance of q-ary cyclic codes are proposed. The first one is proven by embedding the given cyclic code into a cyclic product code. Furthermore, we show that unique…
In continuation to earlier works where the problem of joint information embedding and lossless compression (of the composite signal) was studied in the absence \cite{MM03} and in the presence \cite{MM04} of attacks, here we consider the…
In the following text for arbitrary $X$ with at least two elements, nonempty set $\Gamma$ and self-map $\varphi:\Gamma\to\Gamma$ we prove the set-theoretical entropy of generalized shift $\sigma_\varphi:X^\Gamma\to X^\Gamma$…
Through the consideration of spherically symmetric gravitating systems consisting of perfect fluids with linear equation of state constrained to be in a finite volume, an account is given of the properties of entropy at conditions in which…
We introduce a unified generalization of several well-established high-throughput coding techniques including staircase codes, tiled diagonal zipper codes, continuously interleaved codes, open forward error correction (OFEC) codes, and…
We show that the values of entropies of multidimensional shifts of finite type (SFTs) are characterized by a certain computation-theoretic property: a real number $h\geq 0$ is the entropy of such an SFT if and only if it is right…
The guessing number of a directed graph (digraph), equivalent to the entropy of that digraph, was introduced as a direct criterion on the solvability of a network coding instance. This paper makes two contributions on the guessing number.…
We introduce a class of subshifts governed by finitely many two-sided infinite words. We call these words leading sequences. We show that any locally constant cocycle over such a subshift is uniform. From this we obtain Cantor spectrum of…
The maximum entropy principle is largely used in thresholding and segmentation of images. Among the several formulations of this principle, the most effectively applied is that based on Tsallis non-extensive entropy. Here, we discuss the…
This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of nonorientable surfaces into which such graphs may be embedded. In a previous paper by the authors, the problem of…
Let X be a nonsingular arithmetically Cohen-Macaulay projective scheme, Z a nonsingular subscheme of X. Let \pi: Y --> X be the blowup of X along the ideal sheaf of Z, E_0 the pull-back of a general hyperplane in X and E the exceptional…
An algebraic variety X is embedded to the order k via a line bundle L if the global sections of L generate all (simultaneous) jets of order k on X or if they separate all zero-dimensional subschemes of length at most k+1. Even though we…
Let $G$ be a finitely generated amenable group. We study the space of shifts on $G$ over a given finite alphabet $A$. We show that the zero entropy shifts are generic in this space, and that more generally the shifts of entropy $c$ are…
The surface code is one of the most successful approaches to topological quantum error-correction. It boasts the smallest known syndrome extraction circuits and correspondingly largest thresholds. Defect-based logical encodings of a new…