Exponential Strong Converse for One Helper Source Coding Problem
نویسندگان
چکیده
منابع مشابه
On the Gaussian Listening-Helper Source-Coding Problem
In the Gaussian listening-helper source-coding problem Encoder 1 and Decoder 1 observe respectively a pair of i.i.d. correlated Gaussian sources and both wish to communicate the first source to Decoder 2 subject to a distortion constraint. Encoder 1 sends a message to both decoders and then Decoder 1 – the listening-helper – sends a message just to Decoder 2. We derive an inner bound on the rat...
متن کاملA strong converse for classical channel coding using entangled inputs.
A fully general strong converse for channel coding states that when the rate of sending classical information exceeds the capacity of a quantum channel, the probability of correctly decoding goes to zero exponentially in the number of channel uses, even when we allow code states which are entangled across several uses of the channel. Such a statement was previously only known for classical chan...
متن کاملStrong converse exponent for classical-quantum channel coding
Milán Mosonyi 2, 3, ∗ and Tomohiro Ogawa † Institute for Advanced Studies, Technische Universität München, Lichtenbergstraße 2a, 85748 Garching, Germany Zentrum Mathematik, M5, Technische Universität München, Boltzmannstraße 3, 85748 Garching, Germany Mathematical Institute, Budapest University of Technology and Economics, Egry József u 1., Budapest, 1111 Hungary. Graduate School of Information...
متن کاملCoding Theorem and Strong Converse for Quantum Channels
In this correspondence, we present a new proof of Holevo’s coding theorem for transmitting classical information through quantum channels, and its strong converse. The technique is largely inspired by Wolfowitz’s combinatorial approach using types of sequences. As a byproduct of our approach which is independent of previous ones, both in the coding theorem and the converse, we can give a new pr...
متن کاملCoding Theorem and Strong Converse for Nonstationary Quantum Channels
We study the nonstationary discrete memoryless quantum channel with arbitrary (product state) input, and prove a coding theorem and the strong converse for classical information transmission. The method is that of maximal codes and of packing decoding operators.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2019
ISSN: 1099-4300
DOI: 10.3390/e21060567