Related papers: Variable-Length Constrained Coding and Kraft Condi…
Bell inequalities were meant to test quantum mechanics vs local hidden variable models, but can also be used to verify entanglement. For entanglement verification purposes one assumes the validity of quantum mechanics as well as quantum…
Long-range quantum correlations between particles are usually formulated by assuming the persistence of an entangled state after the particles have spearated. Here this approach is re-examined based upon studying the correlations present in…
First, a canonical form for stabilizer parity check matrices of arbitrary size and rank is derived. Next, it is shown that the closely related canonical form of the Clifford group can be computed in time $O(n^3)$ for $n$ qubits, which…
Latent variable conditional models, including the latent conditional random fields as a special case, are popular models for many natural language processing and vision processing tasks. The computational complexity of the exact…
Let $(X_t)_{t \geq 0}$ be a continuous time Markov process on some metric space $M,$ leaving invariant a closed subset $M_0 \subset M,$ called the {\em extinction set}. We give general conditions ensuring either "Stochastic persistence"…
We investigate dense coding by imposing various locality restrictions to our decoder by employing the resource theory of asymmetry framework. In this task, the sender Alice and the receiver Bob share an entangled state. She encodes the…
In this paper we investigate bounds on rate and minimum distance of codes with $t$ availability. We present bounds on minimum distance of a code with $t$ availability that are tighter than existing bounds. For bounds on rate of a code with…
In this note we consider weighted conditional type operators between different Orlicz spaces and generalized conditional type Holder inequality that we defined in [2]. Then we give some necessary and sufficient conditions for boundedness of…
For any given positive integer $m$, a necessary and sufficient condition for the existence of Type I $m$-adic constacyclic codes is given. Further, for any given integer $s$, a necessary and sufficient condition for $s$ to be a multiplier…
We derive simplified formulas for analyzing the stability of stochastic parametrically forced linear systems. This extends the results in [T. Blass and L.A. Romero, SIAM J. Control Optim. 51(2):1099--1127, 2013] where, assuming the…
This paper presents conditions for constructing permutation-invariant quantum codes for deletion errors and provides a method for constructing them. Our codes give the first example of quantum codes that can correct two or more deletion…
This paper extends deterministic notions of Strong Stability Preservation (SSP) to the stochastic setting, enabling nonlinearly stable numerical solutions to stochastic differential equations (SDEs) and stochastic partial differential…
Quantum error-correcting codes are used to protect quantum information from decoherence. A raw state is mapped, by an encoding circuit, to a codeword so that the most likely quantum errors from a noisy quantum channel can be removed after a…
We derive the coding capacity for duplication-correcting codes capable of correcting any number of duplications. We do so both for reverse-complement duplications, as well as palindromic (reverse) duplications. We show that except for…
The stability for the viscosity solutions of a differential equation with a perturbation term added to the Infinity-Laplace Operator is studied. This is the so-called Infinity-Laplace Equation with variable exponent infinity. An…
The likelihood encoder with a random codebook is demonstrated as an effective tool for source coding. Coupled with a soft covering lemma (associated with channel resolvability), likelihood encoders yield simple achievability proofs for…
The Parity Source Coder is a protocol for data compression which is based on a set of parity checks organized in a sparse random network. We consider here the case of memoryless unbiased binary sources. We show that the theoretical capacity…
In this article, we present semi strongly $E$-preinvexity and semi strongly $E$-invexity. To demonstrate the existence of these functions, certain nontrivial examples have been developed. Several significant relationships and…
A constant-rate encoder--decoder pair is presented for a fairly large family of two-dimensional (2-D) constraints. Encoding and decoding is done in a row-by-row manner, and is sliding-block decodable. Essentially, the 2-D constraint is…
In this paper, on one hand, a class of linear codes with one or two weights is obtained. Based on these linear codes, we construct two classes of constant composition codes, which includes optimal constant composition codes depending on…