Weiqin Chen, Mark Squillante, et al.
AAAI 2025
Motivated by work by Yeung (1994) on the convexity of capacity regions for a multi-user channel, we formulate the general properties of the capacity region for any network of users. In particular, in addition to the usual properties of dominance and convexity, we also consider the bit masking property that a message could be sent to a larger number of receivers than necessary. We derive a general inner bound on the capacity region of a multiuser network without feedback using these properties. © 1998 IEEE.
Weiqin Chen, Mark Squillante, et al.
AAAI 2025
Robert E. Cypher, J. Sanz, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Eberhard Spiller, Janusz Wilczynski
Proceedings of SPIE 1989
Amotz Bar-Noy, Sudipto Guha, et al.
ACM Transactions on Algorithms