On the weakest resource for coordination in arbitrarily varying multiple access channels with conferencing encoders

DOI10.1134/S0032946014010025zbMath1334.94051OpenAlexW2038674615MaRDI QIDQ2262990

Moritz Wiese, Holger Boche

Publication date: 17 March 2015

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946014010025

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

Related Items (1)

Arbitrarily varying multiple access channels with conferencing encoders: list decoding and finite coordination resources

Cites Work

• The Arbitrarily Varying Multiple-Access Channel With Conferencing Encoders
• Exponential error bounds for random codes in the arbitrarily varying channel
• On the deterministic-code capacity of the multiple-access arbitrarily varying channel
• The capacity of the arbitrarily varying channel revisited: positivity, constraints
• Elimination of correlation in random codes for arbitrarily varying channels
• Correlated sources help transmission over an arbitrarily varying channel
• Arbitrarily varying multiple-access channels. I. Ericson's symmetrizability is adequate, Gubner's conjecture is true
• The discrete memoryless multiple access channel with partially cooperating encoders (Corresp.)
• Strong Secrecy for Multiple Access Channels
• Arbitrarily small amounts of correlation for arbitrarily varying quantum channels

This page was built for publication: On the weakest resource for coordination in arbitrarily varying multiple access channels with conferencing encoders