相关论文: Constant Weight Polar Codes through Periodic Marko…
Let $d >1$ and $(A_n)_{n \ge 1}$ be a sequence of independent identically distributed random matrices with nonnegative entries and no zero column. This induces a Markov chain $M_n = A_n M_{n-1}$ on the cone of d-vectors with nonnegative…
Electrostatic interactions involving proteins depend not just on the ionic charges involved but also on their chemical identities. Here we examine the origins of incompletely understood differences in the strength of association of…
There has been much recent research into polarizing an antiproton beam, instigated by the recent proposal from the PAX (Polarized Antiproton eXperiment) project at GSI Darmstadt. It plans to polarize an antiproton beam by repeated…
Minimum weight codewords play a crucial role in the error correction performance of a linear block code. In this work, we establish an explicit construction for these codewords of polar codes as a sum of the generator matrix rows, which can…
For appropriately chosen weights, temporal averages in chaotic systems can be approximated as a weighted sum of averages over reference states, such as unstable periodic orbits. Under strict assumptions, such as completeness of the orbit…
This paper presents a simple algorithm to check whether reachability probabilities in parametric Markov chains are monotonic in (some of) the parameters. The idea is to construct - only using the graph structure of the Markov chain and…
We formalize and analyze the notions of stochastic monotonicity and realizable mono-tonicity for Markov Chains in continuous-time, taking values in a finite partially ordered set. Similarly to what happens in discrete-time, the two notions…
There has been much recent research into polarizing an antiproton beam, instigated by the recent proposal from the PAX (Polarized Antiproton eXperiment) project at GSI Darmstadt. It plans to polarize an antiproton beam by repeated…
We show theoretically that polariton pairs with a high degree of polarization entanglement can be produced through parametric scattering. We demonstrate that it can emerge in coincidence experiments, even at low excitation densities where…
Polar codes are a family of capacity-achieving codes that have explicit and low-complexity construction, encoding, and decoding algorithms. Decoding of polar codes is based on the successive-cancellation decoder, which decodes in a bit-…
The optimal zero delay coding of a finite state Markov source is considered. The existence and structure of optimal codes are studied using a stochastic control formulation. Prior results in the literature established the optimality of…
Recently it has been proposed to construct quantum error-correcting codes that embed a finite-dimensional Hilbert space in the infinite-dimensional Hilbert space of a system described by continuous quantum variables [D. Gottesman et al.,…
This simple note lays out a few observations which are well known in many ways but may not have been said in quite this way before. The basic idea is that when comparing two different Markov chains it is useful to couple them is such a way…
Classical source polar codes require the construction of frozen sets for given sources. While this scheme offers excellent theoretical performance, it faces challenges in practical data compression systems, including sensitivity to the…
The quantum theory of polariton condensation in a trapped state reveals a second-order phase transition evidenced by spontaneous polarization parity breaking in sub-spaces of fixed polariton occupation numbers. The emission spectra of a…
We consider a general honest homogeneous continuous-time Markov process with restarts. The process is forced to restart from a given distribution at time moments generated by an independent Poisson process. The motivation to study such…
We present a rate-compatible polar coding scheme that achieves the capacity of any family of channels. Our solution generalizes the previous results [1], [2] that provide capacity-achieving rate-compatible polar codes for a degraded family…
A family of $\omega$-circulant balanced weighing matrices with classical parameters is used for the construction of optimal constant weight codes over an alphabet of size $g+1$ and length $n=(q^m -1)/(q-1)$, where $q$ is an odd prime power,…
We consider stochastic lattice gases with stationary product weights and a polynomial perturbation vanishing with the system size that leads to condensation. If the density of particles exceeds a critical value the system phase separates…
In this paper we study Markov chains associated with the Metropolis-Hastings algorithm. We consider conditions under which the sequence of the successive densities of such a chain converges to the target density according to the total…