English
Related papers

Related papers: Unambiguously coded shifts

200 papers

Many different systems with explicit substitutions have been proposed to implement a large class of higher-order languages. Motivations and challenges that guided the development of such calculi in functional frameworks are surveyed in the…

Programming Languages · Computer Science 2015-07-01 Delia Kesner

The logic of bunched implications (BI), introduced by O'Hearn and Pym (1999), has attracted significant attention due to its elegant proof calculus, varied semantics, and close connections to the propositional fragment of separation logic.…

Salim El Rouayheb and Kannan Ramchandran introduced the concept of fractional repetition (FR) code. In their article it remained unsolved when we can find such codes. Here we give an exact characterization of situations when it is possible…

Combinatorics · Mathematics 2012-01-18 Toni Ernvall

We introduce the notion of entanglement of subspaces as a measure that quantify the entanglement of bipartite states in a randomly selected subspace. We discuss its properties and in particular we show that for maximally entangled subspaces…

Quantum Physics · Physics 2011-11-09 Gilad Gour , Nolan R. Wallach

Reversible concurrent calculi are abstract models for concurrent systems in which any action can potentially be undone. Over the last few decades, different formalisms have been developed and their mathematical properties have been…

Logic in Computer Science · Computer Science 2025-08-20 Gabriele Cecilia

We address the question of constructing explicitly quasi-uniform codes from groups. We determine the size of the codebook, the alphabet and the minimum distance as a function of the corresponding group, both for abelian and some nonabelian…

Group Theory · Mathematics 2013-01-29 Eldho K. Thomas , Frederique Oggier

New infinite families of quantum symmetric and asymmetric codes are constructed. Several of these are MDS. The codes obtained are shown to have parameters which are better than previously known. A number of known codes are special cases of…

Information Theory · Computer Science 2012-08-14 Kenza Guenda , T. Aaron Gulliver

The input and output algebras of an infinite qubit system and their representations are described.

Quantum Physics · Physics 2007-05-23 G. Sardanashvily

We propose a general description on the unambiguous discrimination of mixed states according to the system-environment coupling, and present a procedure to reduce this to a standard semidefinite programming problem. In the two states case,…

Quantum Physics · Physics 2009-11-13 Xiang-Fa Zhou , Yong-Sheng Zhang , Guang-Can Guo

The lack of uniqueness arising by oversampling of Fourier coefficients is shown to provide a way of transmitting hidden information. A basic encoding/decoding system, developed on the basis of such a possibility, is discussed. The system is…

General Mathematics · Mathematics 2007-05-23 Jody R. Miotke , Laura Rebollo-Neira

We analyze a new group testing scheme, termed semi-quantitative group testing, which may be viewed as a concatenation of an adder channel and a discrete quantizer. Our focus is on non-uniform quantizers with arbitrary thresholds. For the…

Information Theory · Computer Science 2015-06-26 Amin Emad , Olgica Milenkovic

Starting from the full group of symmetries of a system we select a discrete subset of transformations which allows to introduce the Clifford algebra of operators generating new supercharges of extended supersymmetry. The system defined by…

Quantum Physics · Physics 2009-11-07 Andrzej M. Frydryszak , Volodymyr M. Tkachuk

We present a framework to decompose real multivariate polynomials while preserving invariance and positivity. This framework has been recently introduced for tensor decompositions, in particular for quantum many-body systems. Here we…

Mathematical Physics · Physics 2024-08-08 Gemma De las Cuevas , Andreas Klingler , Tim Netzer

This paper is concerned with quasi-unbiased Hadamard matrices and weakly unbiased Hadamard matrices, which are generalizations of unbiased Hadamard matrices, equivalently unbiased bases. These matrices are studied from the viewpoint of…

Combinatorics · Mathematics 2015-10-01 Makoto Araya , Masaaki Harada , Sho Suda

I discuss some of the main interpretations given to explain the indeterministic nature of quantum measurements and show that all has some loopholes in one corner or another. I propose an alternative interpretation based on the notion of…

Quantum Physics · Physics 2009-09-30 M. B. Altaie

We introduce a notion of $\lambda$-graph bisystem. It consists of a pair $({\frak L}^-, {\frak L}^+)$ of two labeled Bratteli diagrams ${\frak L}^-, {\frak L}^+$ over alphabets $\Sigma^-, \Sigma^+$, respectively, and satisfy certain…

Operator Algebras · Mathematics 2020-01-07 Kengo Matsumoto

We present some basic theory on the duality of codes over two non-unital rings of order $6$, namely $H_{23}$ and $H_{32}$. For a code $\mathcal{C}$ over these rings, we associate a binary code $\mathcal{C}_a$ and a ternary code…

Information Theory · Computer Science 2025-02-26 Altaf Alshuhail , Rowena Alma Betty , Lucky Galvez

We establish a natural translation from word rewriting systems to strictly positive polymodal logics. Thereby, the latter can be considered as a generalization of the former. As a corollary we obtain examples of undecidable strictly…

Logic · Mathematics 2016-02-19 Lev D. Beklemishev

We introduce unbounded strongly irreducible operators and transitive operators. These operators are related to a certain class of indecomposable Hilbert representations of quivers on infinite-dimensional Hilbert spaces. We regard the theory…

Functional Analysis · Mathematics 2016-03-28 Masatoshi Enomoto , Yasuo Watatani

We characterize the squares occurring in infinite overlap-free binary words and construct various alpha power-free binary words containing infinitely many overlaps.

Combinatorics · Mathematics 2007-05-23 James Currie , Narad Rampersad , Jeffrey Shallit