Universal Classical-Quantum Superposition Coding and Universal Classical-Quantum Multiple Access Channel Coding

نویسندگان

چکیده

We derive universal classical-quantum superposition coding and multiple access channel by using generalized packing lemmas for the type method. Using our code, we establish capacity region of a compound broadcast with degraded message sets. Our codes have two types codes. One is code joint decoding other separate decoding. It not so easy to construct former that universally achieves general points beyond corner points. First, latter region. Then, converting coder, above desired type.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Universal coding for classical-quantum channel

We construct a universal code for stationary and memoryless classicalquantum channel as a quantum version of the universal coding by Csiszár and Körner. Our code is constructed by the combination of irreducible representation, the decoder introduced through quantum information spectrum, and the packing lemma.

متن کامل

Gallager Bound of Classical-Quantum Channel Coding

Gallager bound is known as the minimum upper bound of average error probability of classical channel coding[5]. Burnashev and Holevo[8] derived its quantum version in the pure states case, and proposed its quantum version in the mixed states case. The attainability of their quantum version has been an open problem, We prove that the bound proposed by them can be attained by a POVM proposed by H...

متن کامل

Exponent for classical-quantum multiple access channel

Multiple-user information theory, or network information theory, was started by C. E. Shannon, the founder of Information Theory [1]. The only multiple-user channel in classical information theory whose single-letter capacity region is completely known, is the multiple access channel (MAC). MAC is a channel with a single output and two (or more) inputs. Its capacity region was determined by R. ...

متن کامل

Universal random codes: Capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender

We consider the compound memoryless quantummultiple-access channel (QMAC) with two sending terminals. In this model, the transmission is governed by the memoryless extensions of a completely positive and trace preserving map which can be any element of a prescribed set of possible maps. We study a communication scenario, where one of the senders shares classical message transmission goals with ...

متن کامل

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...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2022

ISSN: ['0018-9448', '1557-9654']

DOI: https://doi.org/10.1109/tit.2021.3131575