Arbitrarily varying multiple-access channels. I. Ericson's symmetrizability is adequate, Gubner's conjecture is true

DOI10.1109/18.749024zbMath0945.94008OpenAlexW2138378935MaRDI QIDQ4701326

Ning Cai

Publication date: 21 November 1999

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.749024

zbMATH Keywords

Ahlswede's dichotomyarbitrarily varying multiple-access channelaverage errors capacity regionAVMAC

Mathematics Subject Classification ID

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

Related Items (6)

Arbitrarily varying multiple access channels with conferencing encoders: list decoding and finite coordination resources ⋮ Impact of interference in coexisting wireless networks with applications to arbitrarily varying bidirectional broadcast channels ⋮ General theory of information transfer: Updated ⋮ Strong Secrecy for Multiple Access Channels ⋮ On the weakest resource for coordination in arbitrarily varying multiple access channels with conferencing encoders ⋮ Universal random codes: capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender

This page was built for publication: Arbitrarily varying multiple-access channels. I. Ericson's symmetrizability is adequate, Gubner's conjecture is true