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

DOI10.1007/S11128-014-0814-YzbMATH Open1309.81044arXiv1310.1970OpenAlexW2046615784MaRDI QIDQ485359FDOQ485359

Holger Boche, Janis Nötzel

Publication date: 9 January 2015

Published in: Quantum Information Processing (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1310.1970

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

zbMATH Keywords

cooperationquantum informationchannel capacitycommon messageconferencingmultiple access channel

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Cryptography (94A60) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum coding (general) (81P70) Channel models (including quantum) in information and communication theory (94A40)

Cites Work

• The Arbitrarily Varying Multiple-Access Channel With Conferencing Encoders
• Elimination of correlation in random codes for arbitrarily varying channels
• The discrete memoryless multiple access channel with partially cooperating encoders (Corresp.)
• The Compound Multiple Access Channel With Partially Cooperating Encoders
• Capacity of Interference Channels With Partial Transmitter Cooperation
• Title not available (Why is that?)
• Multiple access channels with arbitrarily correlated sources
• Source coding with side information and a converse for degraded broadcast channels
• Title not available (Why is that?)
• The capacity of the quantum multiple-access channel
• Joint source–channel coding for a quantum multiple access channel
• Compound Multiple-Access Channels With Partial Cooperation
• A Coding Theorem for Multiple Access Channels With Correlated Sources
• Classical Communication Over a Quantum Interference Channel
• Arbitrarily small amounts of correlation for arbitrarily varying quantum channels

Cited In (9)

• Universal random codes: capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender
• Classical capacities of quantum channels with environment assistance
• Quantum broadcast channels with cooperating decoders: An information-theoretic perspective on quantum repeaters
• Arbitrarily varying multiple access channels with conferencing encoders: list decoding and finite coordination resources
• Universal Classical-Quantum Superposition Coding and Universal Classical-Quantum Multiple Access Channel Coding
• Classical-quantum arbitrarily varying wiretap channel: common randomness assisted code and continuity
• Capacity theorems for quantum multiple-access channels: classical-quantum and quantum-quantum capacity regions
• Adversarial versus cooperative quantum estimation
• A Strong Converse Theorem for Quantum Multiple Access Channels

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)