The classical-quantum multiple access channel with conferencing encoders and with common messages
From MaRDI portal
(Redirected from Publication:485359)
Abstract: 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 messages, but they are allowed to use a limited amount of noiseless classical communication amongst each other prior to encoding their messages. This conferencing protocol may depend on each individual message they intend to send. The two scenarios are related to each other not only in spirit - the existence of near-optimal codes for the ccq-MAC with common messages is used for proving the existence of near-optimal codes for the ccq-MAC with conferencing encoders.
Recommendations
- Joint source-channel coding for a quantum multiple access channel
- Universal random codes: capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender
- Capacity theorems for quantum multiple-access channels: classical-quantum and quantum-quantum capacity regions
- A Strong Converse Theorem for Quantum Multiple Access Channels
- A Strong Converse Theorem for Quantum Multiple Access Channels
Cites work
- scientific article; zbMATH DE number 3173126 (Why is no real title available?)
- scientific article; zbMATH DE number 3497786 (Why is no real title available?)
- A Coding Theorem for Multiple Access Channels With Correlated Sources
- Arbitrarily small amounts of correlation for arbitrarily varying quantum channels
- Capacity of Interference Channels With Partial Transmitter Cooperation
- Classical Communication Over a Quantum Interference Channel
- Compound Multiple-Access Channels With Partial Cooperation
- Elimination of correlation in random codes for arbitrarily varying channels
- Joint source-channel coding for a quantum multiple access channel
- Multiple access channels with arbitrarily correlated sources
- Source coding with side information and a converse for degraded broadcast channels
- The Arbitrarily Varying Multiple-Access Channel With Conferencing Encoders
- The Compound Multiple Access Channel With Partially Cooperating Encoders
- The capacity of the quantum multiple-access channel
- The discrete memoryless multiple access channel with partially cooperating encoders (Corresp.)
Cited in
(10)- Universal Classical-Quantum Superposition Coding and Universal Classical-Quantum Multiple Access Channel Coding
- Universal random codes: capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender
- Capacity theorems for quantum multiple-access channels: classical-quantum and quantum-quantum capacity regions
- Joint source-channel coding for a quantum multiple access channel
- Adversarial versus cooperative quantum estimation
- Classical capacities of quantum channels with environment assistance
- Quantum broadcast channels with cooperating decoders: an information-theoretic perspective on quantum repeaters
- A Strong Converse Theorem for Quantum Multiple Access Channels
- Arbitrarily varying multiple access channels with conferencing encoders: list decoding and finite coordination resources
- Classical-quantum arbitrarily varying wiretap channel: common randomness assisted code and continuity
This page was built for publication: The classical-quantum multiple access channel with conferencing encoders and with common messages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q485359)
