The Arbitrarily Varying Multiple-Access Channel With Conferencing Encoders
نویسندگان
چکیده
منابع مشابه
Arbitrarily varying multiple access channels with conferencing encoders: List decoding and finite coordination resources
Communication over channels that may vary in an arbitrary and unknown manner from channel use to channel use is studied. Such channels fall in the framework of arbitrarily varying channels (AVCs), for which it has been shown that the classical deterministic approaches with pre-specified encoder and decoder fail if the AVC is symmetrizable. However, more sophisticated strategies such as common r...
متن کاملMIMO Multiple Access Channel with an Arbitrarily Varying Eavesdropper
A two-transmitter Gaussian multiple access wiretap channel with multiple antennas at each of the nodes is investigated. The channel matrices at the legitimate terminals are fixed and revealed to all the terminals, whereas the channel matrix of the eavesdropper is arbitrarily varying and only known to the eavesdropper. The secrecy degrees of freedom (s.d.o.f.) region under a strong secrecy const...
متن کاملThe Classical-Quantum Multiple Access Channel with Conferencing Encoders and with Common Messages
We prove coding theorems for two scenarios of cooperating encoders for the multiple access channel with two classical inputs and one quantum output. In the first scenario (ccq-MAC with common messages), the two senders each have their private messages, but would also like to transmit common messages. In the second scenario (ccq-MAC with conferencing encoders), each sender has its own set of mes...
متن کاملThe Multiple Access Channel with Correlated Sources and Cribbing Encoders
A discrete memoryless multiple access channel (MAC) is a quadruple { X1,X2, PY |X1,X2 ,Y } where X1,X2 are the input alphabets, Y the output alphabet, and PY |X1,X2 a transition probability matrix from X1 × X2 to Y . For shorthand notation, we will refer to the MAC by PY |X1,X2 . A source pair is a triplet {U ,V, PU,V } where PU,V is a distribution on U × V . We use the following notation: rand...
متن کاملNonconvexity of the capacity region of the multiple-access arbitrarily varying channel subject to constraints
Abstruct-The random-code capacity region of the multiple-access arbitrarily varying channel subject to both state and input constraints is determined. Consideration of a simple erasure channel shows that the capacity region is not convex in general.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2013
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2012.2229779