The Arbitrarily Varying Multiple-Access Channel With Conferencing Encoders
From MaRDI portal
Abstract: We derive the capacity region of arbitrarily varying multiple-access channels with conferencing encoders for both deterministic and random coding. For a complete description it is sufficient that one conferencing capacity is positive. We obtain a dichotomy: either the channel's deterministic capacity region is zero or it equals the two-dimensional random coding region. We determine exactly when either case holds. We also discuss the benefits of conferencing. We give the example of an AV-MAC which does not achieve any non-zero rate pair without encoder cooperation, but the two-dimensional random coding capacity region if conferencing is possible. Unlike compound multiple-access channels, arbitrarily varying multiple-access channels may exhibit a discontinuous increase of the capacity region when conferencing in at least one direction is enabled.
Cited in
(7)- On the weakest resource for coordination in arbitrarily varying multiple access channels with conferencing encoders
- Dirty-Paper Coding for the Gaussian Multiaccess Channel With Conferencing
- Arbitrarily varying multiple access channels with conferencing encoders: list decoding and finite coordination resources
- Arbitrarily varying multiple-access channels. I. Ericson's symmetrizability is adequate, Gubner's conjecture is true
- The classical-quantum multiple access channel with conferencing encoders and with common messages
- Strong secrecy for multiple access channels
- Structured Mappings and Conferencing Common Information for Multiple-Access Channels
This page was built for publication: The Arbitrarily Varying Multiple-Access Channel With Conferencing Encoders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989354)
