Related papers: Unambiguously coded shifts

This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…

We introduce invariants, called shifting numbers, that measure the asymptotic amount by which an autoequivalence of a triangulated category translates inside the category. The invariants are analogous to Poincare translation numbers that…

We define observability and detectability for linear switching systems as the possibility of reconstructing and respectively of asymptotically reconstructing the hybrid state of the system from the knowledge of the output for a suitable…

This paper presents a new observer design approach for linear time invariant multivariable systems subject to unknown inputs. The design is based on a transformation to the so-called special coordinate basis. This form reveals important…

The notion of composite system made up of distinguishable parties is investigated in the context of arbitrary convex spaces.

Recently Liu, Long, Tong and Li [Phys. Rev. A 65, 022304 (2002)] have proposed a scheme for superdense coding between multiparties. This scheme seems to be highly asymmetric in the sense that only one sender effectively exploits…

A numeral system is an infinite sequence of different closed normal $\lambda$-terms intended to code the integers in $\lambda$-calculus. H. Barendregt has shown that if we can represent, for a numeral system, the functions : Successor,…

Using an algebraic approach based on the theory of Coxeter groups, we design, and describe the performance of, a class of line codes for parallel transmission of $b$ bits over $b+1$ wires that admit especially simple encoding and decoding…

In this paper cyclic codes are established with respect to the Mannheim metric over some finite rings by using Gaussian integers and the decoding algorithm for these codes is given.

We introduce a class of linear bounded invertible operators on Banach spaces, called shift operators, which comprises weighted backward shifts and models finite products of weighted backward shifts and dissipative composition operators. We…

Let $n \geq 1$ be an odd integer. We construct an anticyclotomic Euler system for certain cuspidal automorphic representations of unitary groups with signature $(1, 2n-1)$.

We consider questions posed in a recent paper of Mandayam, Bandyopadhyay, Grassl and Wootters [10] on the nature of "unextendible mutually unbiased bases." We describe a conceptual framework to study these questions, using a connection…

C. Bonnaf{\'e}, M. Geck, L. Iancu, and T. Lam have conjectured a description of one-sided cells in unequal parameter Hecke algebras of type $B$ which is based on domino tableaux of arbitrary rank. In the integer case, this generalizes the…

In the context of the variational bi-complex, we re-explain that irreducible gauge systems define a particular example of a Lie algebroid. This is used to review some recent and not so recent results on gauge, global and asymptotic…

The concept of complementability is extended from bounded operators to densely defined operators on Hilbert spaces. By introducing appropriate projections and decomposition techniques, a framework is developed for analyzing…

Karush's proof of McMillan's theorem is recast as an argument involving polynomials with non-commuting indeterminates certain evaluations of which yield the Kraft sums of codes, proving a strengthened version of McMillan's theorem.

An infinite binary sequence A is absolutely undecidable if it is impossible to compute A on a set of positions of positive upper density. Absolute undecidability is a weakening of bi-immunity. Downey, Jockusch and Schupp asked whether,…

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 address the recently suggested problem of causal lossless coding of a randomly arriving source samples. We construct variable-to-fixed coding schemes and show that they outperform the previously considered fixed-to-variable schemes when…

We introduce a notion of coded equivalence in one-sided topological Markov shifts. The notion is inspired by coding theory. One-sided topological conjugacy implies coded equivalence. We will show that coded equivalence implies continuous…