相关论文: Bifix codes and interval exchanges

We study the concept of a code (or shift) space for a generalized iterated function system (GIFS in short). We prove that relations between GIFSs and their code spaces are analogous to the case of classical IFSs. As an application, we…

We associate bicomplexes with several integrable models in such a way that conserved currents are obtained by a simple iterative construction. Gauge transformations and dressings are discussed in this framework and several examples are…

We study the class of quasi-alphabetic relations, i.e., tree transformations defined by tree bimorphisms with two quasi-alphabetic tree homomorphisms and a regular tree language. We present a canonical representation of these relations; as…

We consider symbolic flows over finite alphabets and study certain kinds of repetitions in these sequences. Positive and negative results for the existence of such repetitions are given for codings of interval exchange transformations and…

Given a typical interval exchange transformation, we may naturally associate to it an infinite sequence of matrices through Rauzy induction. These matrices encode visitations of the induced interval exchange transformations within the…

We show that a typical interval exchange transformation is either weakly mixing or it is an irrational rotation. We also conclude that a typical translation flow on a surface of genus $g \geq 2$ (with prescribed singularity types) is weakly…

Interval translation maps (ITMs) are a non-invertible generalization of interval exchange transformations (IETs). The dynamics of finite type ITMs is similar to IETs, while infinite type ITMs are known to exhibit new interesting effects. In…

Spatially-coupled low-density parity-check codes attract much attention due to their capacity-achieving performance and a memory-efficient sliding-window decoding algorithm. On the other hand, the encoder needs to solve large linear…

In this paper, we investigate the necessity of finite blocklength codes in distributed transmission of independent message sets over channels with feedback. Previously, it was shown that finite effective length codes are necessary in…

Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…

In this paper, diversity analysis of bit-interleaved coded multiple beamforming (BICMB) is extended to the case of general spatial interleavers, removing a condition on their previously known design criteria and quantifying the resulting…

We compute how elastic deformations of optical fibers affect light propagation therein. Specifically, we consider differences in wave-guiding properties of straight fibers subject to different external temperatures, pressures, and…

In this paper, we present some new connections between BCK- algebras and binary block codes.

Classification of different forms of quantum entanglement is an active area of research, central to development of effective quantum computers, and similar to classification of error-correction codes, where code duality is broadened to…

Bi-modal (respectively, multi-modal) constrained coding refers to an encoding model whereby a user input block can be mapped to two (respectively, multiple) codewords. In current storage applications, such as optical disks, multi-modal…

We establish conditions for the existence of a family of piecewise linear invariant curves in a two-parameter family of piecewise isometries on the upper half-plane known as Translated Cone Exchange Transformations. We show that these…

Resonance coupling in non-Hermitian systems can lead to exotic features, such as bound states in the continuum (BICs) and exceptional points (EPs), which have been widely employed to control the propagation and scattering of light. Yet,…

We formulate learning of a binary autoencoder as a biconvex optimization problem which learns from the pairwise correlations between encoded and decoded bits. Among all possible algorithms that use this information, ours finds the…

For general exact repair regenerating codes, the optimal trade-offs between storage size and repair bandwith remain undetermined. Various outer bounds and partial results have been proposed. Using a simple chain rule argument we identify…

We investigate the effects of spin-momentum locking on the interference and diffraction patterns due to a double- or single-slit in an electronic \emph{Gedankenexperiment}. We show that the inclusion of the spin-degree-of-freedom, when…