Entanglement-Assisted Zero-Error Source-Channel Coding
نویسندگان
چکیده
منابع مشابه
Zero-error Source-channel Coding with Entanglement
We study the use of quantum entanglement in the zero-error source-channel coding problem. Here, Alice and Bob are connected by a noisy classical one-way channel, and are given correlated inputs from a random source. Their goal is for Bob to learn Alice’s input while using the channel as little as possible. In the zero-error regime, the optimal rates of source codes and channel codes are given b...
متن کاملZero-Error Source-Channel Coding With Side Information
We consider coding for transmission of a source through a channel without error when the receiver has side information about the source. We show that separate source and channel coding is asymptotically suboptimal in general. By contrast, in the case of vanishingly small probability of error, separate source and channel coding is known to be asymptotically optimal. For the zero-error case, we s...
متن کاملUniversal Zero-Delay Joint Source-Channel Coding
We consider zero-delay joint source-channel coding of individual source sequences for a general known channel. Given an arbitrary finite set of schemes with finite-memory (not necessarily time-invariant) decoders, a scheme is devised that does essentially as well as the best in the set on all individual source sequences. Using this scheme, we construct a universal zero-delay joint source-channe...
متن کاملBounds on Entanglement Assisted Source-channel Coding Via the Lovász Theta Number and Its Variants
After Alice’s measurement, Bob’s half of the entanglement resource is in the state ρs = TrA{(M s ⊗ I)|ψ〉 〈ψ|}. An error free decoding operation exists for Bob if and only if these states are orthogonal for every x ∈ X consistent with the information in Bob’s possession (i.e. u and v) [3]. ρs ⊥ ρ y t for all x ∼G y and s 6∼H t. If such |ψ〉 and {Mx s } exist, we say there is an entanglement assis...
متن کاملOn zero-error source coding with decoder side information
Let ( ) be a pair of random variables distributed over a finite product set according to a probability distribution ( ). The following source coding problem is considered: the encoder knows , while the decoder knows and wants to learn without error. The minimum zero-error asymptotic rate of transmission is shown to be the complementary graph entropy of an associated graph. Thus, previous result...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2015
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2014.2385080