Related papers: Decompositions of factor codes and embeddings betw…

Entanglement is a physical phenomenon that each state cannot be described individually. Entanglement entropy gives quantitative understanding to the entanglement. We use decomposition of the Hilbert space to discuss properties of the…

We study two-interval holographic entanglement entropy and entanglement wedge cross section in cutoff AdS. In particular, we investigate phase transitions of them. For two-interval entanglement entropy, the transition point monotonically…

This paper studies the problem of decomposing a low-rank positive-semidefinite matrix into symmetric factors with binary entries, either $\{\pm 1\}$ or $\{0,1\}$. This research answers fundamental questions about the existence and…

Using the AdS/CFT correspondence, we examine entanglement entropy for a boundary theory deformed by a relevant operator and establish two results. The first is that if there is a contribution which is logarithmic in the UV cut-off, then the…

We construct analogs of the embedding of orthogonal and symplectic groups into unitary groups in the context of fusion categories. At least some of the resulting module categories also appear in boundary conformal field theory. We determine…

The paper presents a comprehensive study of group codes from non-abelian split metacyclic group algebras. We derive an explicit Wedderburn-like decomposition of finite split metacyclic group algebras over fields with characteristic coprime…

We study a quantity called discrete layered entropy, which approximates the Shannon entropy within a logarithmic gap. Compared to the Shannon entropy, the discrete layered entropy is piecewise linear, approximates the expected length of the…

We show that the typical coordinate-wise encoding of multivariate ergodic source into prescribed alphabets has the entropy profile close to the convolution of the entropy profile of the source and the modular polymatroid that is determined…

Let $X$ be a $2$-dimensional subshift of finite type generated by a finite set of forbidden blocks (of finite size). We give an algorithm for generating the elements of the shift space using sequence of finite matrices (of increasing size).…

This paper presents encoding and decoding algorithms for several families of optimal rank metric codes whose codes are in restricted forms of symmetric, alternating and Hermitian matrices. First, we show the evaluation encoding is the right…

This paper investigates achievable information rates and error exponents of mismatched decoding when the channel belongs to the class of channels that are close to the decoding metric in terms of relative entropy. For both discrete- and…

We show that if $G$ is a a countable amenable group with the comparison property, and $X$ is a strongly irreducible $G$-shift satisfying certain aperiodicity conditions, then $X$ factors onto the full $G$-shift over $N$ symbols, so long as…

We present a unifying approach to the study of entropies in Mathematics, such as measure entropy, topological entropy, algebraic entropy, set-theoretic entropy. We take into account discrete dynamical systems, that is, pairs $(X,T)$, where…

An avoshift is a subshift where for each set $C$ from a suitable family of subsets of the shift group, the set of all possible valid extensions of a globally valid pattern on $C$ to the identity element is determined by a bounded…

We define a notion of (one-sided) shift spaces over infinite alphabets. Unlike many previous approaches to shift spaces over countable alphabets, our shift spaces are compact Hausdorff spaces. We examine shift morphisms between these shift…

The distribution of the deformations of elementary cells is studied in an abstract lattice constructed from the existence of the empty set. One combination rule determining oriented sequences with continuity of set-distance function in such…

We investigated a suitable auxiliary channel setting and the gap between Q-factors with hard and soft demapping. The system margin definition should be reconsidered for systems employing complex coded modulation with soft forward error…

Subspace codes and particularly constant dimension codes have attracted much attention in recent years due to their applications in random network coding. As a particular subclass of subspace codes, cyclic subspace codes have additional…

In this paper we study ergodic theory of countable Markov shifts. These are dynamical systems defined over non-compact spaces. Our main result relates the escape of mass, the measure theoretic entropy, and the entropy at infinity of the…

Let $G$ be a residually finite group and let $A$ be a finite set. We prove that if $X \subset A^G$ is a strongly irreducible subshift of finite type containing a periodic configuration then periodic configurations are dense in $X$. The…