The classical-quantum multiple access channel with conferencing encoders and with common messages (Q485359)

The paper reconsiders an old subject from Shannon's information theory. Namely the capacity of transmission through multiple access channels, by introducing two new concepts: conference encoders, and quantum channel (used as communication support). The idea of cooperating between at least two senders for building a message designated to a receiver appears first time in [\textit{F. M. J. Willems}, IEEE Trans. Inf. Theory 29, 441--445 (1983; Zbl 0504.94024)] where the model of MAC (multiple access channel) was defined. In this paper the authors use some Willems' theorems and proofs and extend this concept to ccq-MAC (classical, classical-quantum multiple access channel). Main results are contained in Section 4 (previously sections are dedicated to clarify the most important notions used, and section 5 contains only proofs and short comments): four theorems about bounds on capacity region regarding the ccq-MAC with conference encoders, and respectively ccq-MAC with common messages, combined in two parts (direct and converse). The main idea of these results, outlined by authors is ``Conferencing can enlarge the capacity region of a ccq-MAC''. Moreover, it seems that the quantum calculus can offer the possibility to extend some performances of classical communication channels. Some of results from this item were previously presented in [\textit{H. Boche} and \textit{J. Nötzel}, ``Cooperation for the classical-quantum multiple access channel'', in: Proc. of IEEE International Symposium on Inf. Theory, Hawaii, USA. 156--160 (2013)].