NEW CONCATENATION SCHEMES BASED ON THE MULTITHRESHOLD DECODERS OF CONVOLUTIONAL SELF-ORTHOGONAL CODES FOR GAUSSIAN CHANNELS

New serial concatenation schemes based on the multithreshold decoders and di- vergent principle for the convolutional self-orthogonal codes under Gaussian channels are proposed. Using both binary and symbolic decoders on the second decoding stage of the convolutional codes are considered. Simulation results are indicated the higher performance characteristics of the proposed cascade schemes on majority decoders in comparison with clas- sical schemes based on the Viterbi algorithm and Reed-Solomon codes. A moderate increase in decoding delay during concatenation is revealed. It is determined by the absence of the need to use traditional two-dimensional concatenated structures.

Kelly Betting with Quantum Payoff: a continuous variable approach

The main purpose of this study is to introduce a semi-classical model describing betting scenarios in which, at variance with conventional approaches, the payoff of the gambler is encoded into the internal degrees of freedom of a quantum memory element. In our scheme, we assume that the invested capital is explicitly associated with the quantum analog of the free-energy (i.e. ergotropy functional by Allahverdyan, Balian, and Nieuwenhuizen) of a single mode of the electromagnetic radiation which, depending on the outcome of the betting, experiences attenuation or amplification processes which model losses and winning events. The resulting stochastic evolution of the quantum memory resembles the dynamics of random lasing which we characterize within the theoretical setting of Bosonic Gaussian channels. As in the classical Kelly Criterion for optimal betting, we define the asymptotic doubling rate of the model and identify the optimal gambling strategy for fixed odds and probabilities of winning. The performance of the model are hence studied as a function of the input capital state under the assumption that the latter belongs to the set of Gaussian density matrices (i.e. displaced, squeezed thermal Gibbs states) revealing that the best option for the gambler is to devote all their initial resources into coherent state amplitude.

A Computable Gaussian Quantum Correlation for Continuous-Variable Systems

Generally speaking, it is difficult to compute the values of the Gaussian quantum discord and Gaussian geometric discord for Gaussian states, which limits their application. In the present paper, for any (n+m)-mode continuous-variable system, a computable Gaussian quantum correlation M is proposed. For any state ρAB of the system, M(ρAB) depends only on the covariant matrix of ρAB without any measurements performed on a subsystem or any optimization procedures, and thus is easily computed. Furthermore, M has the following attractive properties: (1) M is independent of the mean of states, is symmetric about the subsystems and has no ancilla problem; (2) M is locally Gaussian unitary invariant; (3) for a Gaussian state ρAB, M(ρAB)=0 if and only if ρAB is a product state; and (4) 0≤M((ΦA⊗ΦB)ρAB)≤M(ρAB) holds for any Gaussian state ρAB and any Gaussian channels ΦA and ΦB performed on the subsystem A and B, respectively. Therefore, M is a nice Gaussian correlation which describes the same Gaussian correlation as Gaussian quantum discord and Gaussian geometric discord when restricted on Gaussian states. As an application of M, a noninvasive quantum method for detecting intracellular temperature is proposed.

The Entropy Gain of Linear Systems and Some of Its Implications

We study the increase in per-sample differential entropy rate of random sequences and processes after being passed through a non minimum-phase (NMP) discrete-time, linear time-invariant (LTI) filter G. For LTI discrete-time filters and random processes, it has long been established by Theorem 14 in Shannon’s seminal paper that this entropy gain, (G), equals the integral of log|G|. In this note, we first show that Shannon’s Theorem 14 does not hold in general. Then, we prove that, when comparing the input differential entropy to that of the entire (longer) output of G, the entropy gain equals (G). We show that the entropy gain between equal-length input and output sequences is upper bounded by (G) and arises if and only if there exists an output additive disturbance with finite differential entropy (no matter how small) or a random initial state. Unlike what happens with linear maps, the entropy gain in this case depends on the distribution of all the signals involved. We illustrate some of the consequences of these results by presenting their implications in three different problems. Specifically: conditions for equality in an information inequality of importance in networked control problems; extending to a much broader class of sources the existing results on the rate-distortion function for non-stationary Gaussian sources, and an observation on the capacity of auto-regressive Gaussian channels with feedback.