Citation Context

...the former was solved by Shannon [9] using “Shannon strategies,” and the latter does not increase capacity. The degraded broadcast channel is addressed in [10]. For follow-up work on our problem, see =-=[8]-=- and Theorem 2 ahead. The rest of this paper is organized as follows. The definitions and main results pertaining to the first scenario, in which the encoders learn the state sequence strictly causall...

Citation Context

...tate scenarios. For the single-state scenario, we present a new inner bound on the capacity region. This bound contains the inner bound of [1] (which was extended to the many-transmitters scenario in =-=[3]-=-). We also provide an example showing that the inclusion can be strict. By adapting this example to the double-state scenario, we provide an example showing that—as conjectured in [3]—the inner bound ...

Citation Context

...rmation available strictly causally at the encoders, unlike for point-to-point channels, capacity gains can be accrued by leveraging strictly causal state information at the encoders. Our recent work =-=[13]-=- further extended such results to MACs with arbitrary number of users by proposing a coding scheme inspired by noisy network coding [14]. In [4], [5], [13], the main idea is to let each transmitter co...

Citation Context

...dependent channels: The energy level at the transmitter is a state that is available to only the transmitter. Single-user and multiple access state-dependent channels have been well investigated [12]–=-=[17]-=-. Specifically, when causal state information at the transmitters is available, Shannon strategies are capacity achieving for the single-user state-dependent channels and provide an achievable region ...

Citation Context

... vehicle. The communication strategy we propose here is suboptimal, since the optimal strategy that minimizes the distortion in our problem setting is an open problem in information theory (see [16], =-=[18]-=- for details). It is straightforward to show that, in the general case, finding an optimal trajectory for a vehicle to minimize distortion is NP-hard. We also show that distortion does not possess the...

Citation Context

...ied. In addition to the generalizations previously mentioned (i.e. [2], [3], [4], [1]), we show that our adaptive action framework recovers prior results on multiple access channels with states [12], =-=[13]-=-. The rest of this paper is organized as follows. Section II describes the basic channel model with discrete alphabets, characterizes the capacity–distortion function, establishes its achievability an...

Citation Context

...of users with common state. As a special case, the region for the two-user MAC with common state given in [3] is recovered. Due to space limitation, most of the proofs are omitted and can be found in =-=[11]-=-. Notation: Probability distributions are identified by their 2011 IEEE International Symposium on Information Theory Proceedings978-1-4577-0594-6/11/$26.00 ©2011 IEEE 2807 arguments, e.g., PX (x) = P...

Citation Context

... [1], which reduces to Dirty Paper Coding (DPC) [15] in the corresponding Gaussian model with an additive state. The state-dependent MAC with various form of CSIT and no CSIR has been studied in [16]–=-=[21]-=-. Assuming noncausal CSIT, the capacity regions for such MAC models are still unknown except the following special instances: the MAC with one informed encoder and degraded messages [18]; the binary M...

Citation Context

... causally and strictly causally to one encoder, is considered and an achievable rate region, which is shown to contain an achievable region where each user applies Shannon strategies, is proposed. In =-=[15]-=-, another achievable rate region for the same problem is proposed and in [16] it is shown that this region can be strictly larger than the one proposed in [14]. In [14] it is also shown that strictly ...