A Note on Multiple-Access Channels with Strictly-Causal State\n Information

2011/06/02 by Amos Lapidoth, Lapidoth, Amos, Yossef Steinberg +1
Computer Science · Engineering · #Advanced Memory and Neural Computing #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques

paper · pdf · doi:10.48550/arxiv.1106.0380

openalex publication_date 2011/06/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We propose a new inner bound on the capacity region of a memoryless\nmultiple-access channel that is governed by a memoryless state that is known\nstrictly causally to the encoders. The new inner bound contains the previous\nbounds, and we provide an example demonstrating that the inclusion can be\nstrict.\n A variation on this example is then applied to the case where the channel is\ngoverned by two independent state sequences, where each transmitter knows one\nof the states strictly causally. The example proves that, as conjectured by Li\net al., an inner bound that they derived for this scenario can indeed by\nstrictly better than previous bounds.\n

Related

• On Multiple User Channels with Causal State Information at the Transmitters
• Capacity Bounds for Multiuser Channels with Non-Causal Channel State Information at the Transmitters
• On the Capacity of Multiple Access Channels with State Information and Feedback
• Capacity Region of Multiple Access Channel with States Known Noncausally at One Encoder and Only Strictly Causally at the Other Encoder
• On the Capacity of Memoryless Finite-State Multiple Access Channels with\n Asymmetric Noisy State Information at the Encoders