Papers
Topics
Authors
Recent
Search
2000 character limit reached

Communicating over a Classical-Quantum MAC with State Information Distributed at Senders

Published 2 Mar 2022 in cs.IT, math-ph, math.IT, and math.MP | (2203.01308v3)

Abstract: We consider the problem of communicating over a classical-quantum (CQ) multiple access channel with random classical states non-causally available at the transmitter, referred to as a QMSTx. QMSTx is a classical-quantum multiple access analogue of the channel considered by Gelfand and Pinsker in 1980. We undertake a Shannon-theoretic study and focus on the problem of characterizing inner bounds to the capacity region of a QMSTx. We propose a new coding scheme based on \textit{union coset codes} - codes possessing algebraic properties and derive a new inner bound that subsumes the inner based on IID random coding. We identify examples for which the derived inner bound is strictly larger.

Citations (1)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.