An Achievable Rate Region for 3-User Classical-Quantum Broadcast Channels
share
We consider the scenario of communicating on a 3user classical-quantum broadcast channel. We undertake an information theoretic study and focus on the problem of characterizing an inner bound to its capacity region. We design a new coding scheme based partitioned coset codes - an ensemble of codes possessing algebraic properties. Analyzing its information-theoretic performance, we characterize a new inner bound. We identify examples for which the derived inner bound is strictly larger than that achievable using IID random codes.
READ FULL TEXT