相关论文: Optimal compression for mixed signal states

A scheme for optimal and deterministic linear optical purification of mixed squeezed Gaussian states is proposed and experimentally demonstrated. The scheme requires only linear optical elements and homodyne detectors, and allows the…

Secure distributed data compression in the presence of an eavesdropper is explored. Two correlated sources that need to be reliably transmitted to a legitimate receiver are available at separate encoders. Noise-free, limited rate links from…

A novel data compression scheme is presented. The method is very suitable for black and white images, and it can generate a compression factor of eight; in general the bitmap is optimized for an arbitary number of colors and not only for…

In this letter, we consider the problem of detecting a high dimensional signal based on compressed measurements with physical layer secrecy guarantees. We assume that the network operates in the presence of an eavesdropper who intends to…

We consider the problem of successive-refinement coding for lossy compression of individual sequences, namely, compression in two stages, where in the first stage, a coarse description at a relatively low rate is sent from the encoder to…

This paper addresses optimal decoding strategies in lossy compression where the assumed distribution for compressor design mismatches the actual (true) distribution of the source. This problem has immediate relevance in standardized…

We consider the following communication task in the multi-party setting, which involves a joint random variable $XYZMN$ with the property that $M$ is independent of $YZN$ conditioned on $X$ and $N$ is independent of $XZM$ conditioned on…

We consider the problems of compressed sensing and optimal denoising for signals $\mathbf{x_0}\in\mathbb{R}^N$ that are monotone, i.e., $\mathbf{x_0}(i+1) \geq \mathbf{x_0}(i)$, and sparsely varying, i.e., $\mathbf{x_0}(i+1) >…

I investigate dense coding with a general mixed state on the Hilbert space $C^{d}\otimes C^{d}$ shared between a sender and receiver. The following result is proved. When the sender prepares the signal states by mutually orthogonal unitary…

We consider correlated and distributed sources without cooperation at the encoder. For these sources, we derive the best achievable performance in the rate-distortion sense of any distributed compressed sensing scheme, under the constraint…

Using a mild variant of polar codes we design linear compression schemes compressing Hidden Markov sources (where the source is a Markov chain, but whose state is not necessarily observable from its output), and to decode from Hidden Markov…

We present and study a scheme for lossless causal compression of periodic real-valued signals. In particular, our technique compresses a vector-valued signal to a scalar-valued signal by mixing it with another periodic signal. The…

The problem of maximizing the average rate in a multicast network subject to a coverage constraint (minimum quality of service) is studied. Assuming the channel state information is available only at the receiver side and single antenna…

Consider a lossy compression system with $\ell$ distributed encoders and a centralized decoder. Each encoder compresses its observed source and forwards the compressed data to the decoder for joint reconstruction of the target signals under…

In remote control, efficient compression or representation of control signals is essential to send them through rate-limited channels. For this purpose, we propose an approach of sparse control signal representation using the compressive…

We give an algorithm that learns a representation of data through compression. The algorithm 1) predicts bits sequentially from those previously seen and 2) has a structure and a number of computations similar to an autoencoder. The…

In this paper, we consider IRS-assisted transmissions from a multi-antenna access point (AP) to a receiver with uncertain channel information. By adjusting the magnitude of reflecting coefficients, the IRS can sustain its operations by…

Storage systems often rely on multiple copies of the same compressed data, enabling recovery in case of binary data errors, of course, at the expense of a higher storage cost. In this paper we show that a wiser method of duplication entails…

We describe lossless quantum compression of unknown mixtures (of non-orthogonal states) and give an expression of the optimal rate of compression.

Numerous applications in signal processing have benefited from the theory of compressed sensing which shows that it is possible to reconstruct signals sampled below the Nyquist rate when certain conditions are satisfied. One of these…