47 problems
- 0 votes0 replies0 views
Lapidoth–Shamai–Wigger conjecture on the sum-DoF of the 2-user MISO broadcast channel
Let a 2-user multiple-input-single-output broadcast channel have finite-precision channel state information at the transmitter, meaning that the channel estimation error does not i…
- 0 votes0 replies1 view
Lapidoth's finite-precision CSIT conjecture for MISO broadcast channels
Let a MISO broadcast channel be a multiple-input single-output broadcast channel, and suppose that the channel-state information at the transmitter has finite precision. Lapidoth's…
- 0 votes0 replies0 views
Nair–Wang conjecture for the binary skew-symmetric broadcast channel
Let be the input and outputs of the binary skew-symmetric broadcast channel (BSSC), and let and be random variables such that forms a Markov…
- 0 votes0 replies1 view
Marton's conjecture for the capacity region of general classical broadcast channels
Marton's conjecture. This rate region characterizes the capacity region of every general two-user classical broadcast channel. Marton's region is the best known achievable region f…
- 0 votes0 replies0 views
Cover's capacity-region conjecture for degraded broadcast channels
Cover's capacity-region conjecture. The capacity region consists of the triples of nonnegative rates satisfying
- 0 votes0 replies0 views
Monotonicity of proportional fair capacity for Gaussian broadcast channels
Let denote the proportional fair capacity of a Gaussian broadcast channel with noise vector and total power . Let denote the co…
- 0 votes0 replies1 view
The conjecture that fixed-quality imperfect CSI yields multiplexing gain one
Multiplexing-gain-one conjecture. The multiplexing gain of the sum capacity is equal to .
- 0 votes0 replies0 views
Cover's superposition-coding conjecture for degraded broadcast channels
Let a broadcast channel (BC) be a communication channel with one transmitter and multiple receivers, and let a BC be degraded when the receivers' outputs form a degraded Markov cha…
- 0 votes0 replies0 views
Optimality of the three-auxiliary Marton's inner bound for broadcast channels
Let be a broadcast channel, and let denote the th level of the linear entropy hierarchy. The capacity region is the set of achievable rate pairs…
- 0 votes0 replies0 views
Zaidi et al.'s discreteness conjecture for the information bottleneck input distribution
Let be a Markov chain, with , where and are independent, , and the input satisfies . Suppose that the bottleneck output …
- 0 votes0 replies0 views
Bergmans' tightness conjecture for the successive-decoding inner bound
Consider the capacity region for the degraded broadcast channel with general message sets, and the inner bound obtained by successive decoding of the merged messages, where each re…
- 0 votes0 replies0 views
Conjecture on the sum DoF of the decentralized MIMO broadcast channel
Consider the decentralized MIMO broadcast channel with , where denotes the number of informed transmit antennas and denotes the sum de…
- 0 votes0 replies0 views
Conjecture that conventional perfect-CSIT techniques increasingly diverge from practice with antenna density
The setting is a multi-antenna broadcast channel with partial channel-state information at the transmitter (CSIT), where conventional approaches adapt techniques designed for perfe…
- 0 votes0 replies0 views
Capacity-achieving conjecture for the three-common-receiver achievable region
Consider the three-common-receiver instance of the K-user deterministic broadcast channel with two groupcast messages, and let the achievable region be the one given by Theorem 4.…
- 0 votes0 replies1 view
SLS optimality regime for more than three users
SLS optimality conjecture. For the user setting, these bounds should be sufficient to identify a regime in which SLS is optimal.
- 0 votes0 replies0 views
Finiteness of non-redundant entropy bounds
Finiteness conjecture. Only finitely many of these bounds should be non-redundant; determining the precise set of redundant bounds, or proving that only finitely many bounds exist,…
- 0 votes0 replies0 views
Theorem 3's expurgated bound dominates the first two bounds for high-beta decoding metrics
High-beta dominance conjecture. For either metric, as , the bound of Theorem 3 is at least as tight as the maximum of the bounds of Theorems 1 and 2:
- 0 votes0 replies0 views
Shamai–Tuninetti conjecture on the tightness of the fading broadcast-channel inner bound
Consider the two-user ergodic fading broadcast channel and the inner bound on its capacity region obtained by Shamai and Tuninetti. Shamai–Tuninetti conjecture. Their inner bound i…
- 0 votes0 replies0 views
Optimal sum beamforming gain for the MISO broadcast channel with feedback
MISO broadcast-channel sum-gain conjecture. The optimal sum beamforming gain is
- 0 votes0 replies1 view
Nonattainability of the outer bound under bandwidth mismatch
Nonattainability conjecture. For both bandwidth compression and bandwidth expansion, the outer bound cannot be achieved by any source-channel code.
- 0 votes0 replies1 view
Optimality of the pre-coding for broadcast channels with receiver message side information
Consider a two-receiver memoryless broadcast channel with states and receiver message side information (RMSI), together with the corresponding channel without RMSI. Let a transmiss…
- 0 votes0 replies0 views
Capacity characterization for group leaders satisfying the receiver side-information condition
Consider a private-message AWGN broadcast channel with receivers, ordered by noise levels as . A group leader is the common subgraph obtained f…
- 0 votes0 replies1 view
Tandon et al.'s fixed-CSIT DoF conjecture for the two-user MISO broadcast channel
Consider a two-user MISO broadcast channel in which the transmitter has perfect CSIT for one user and no CSIT for the other. Tandon et al.'s conjecture. With fixed CSIT, the optima…
- 0 votes0 replies0 views
The conjecture that the 28/11 sum-DoF bound is not tight for CSIT pattern (b)
Consider the -user MISO broadcast channel with alternating channel-state information at the transmitter (CSIT). For the marginal probabilities shown in figure (7), namely … patt…
- 0 votes0 replies0 views
Conjecture that more users decrease the required feedback frequency
Feedback-frequency conjecture. Increasing the number of users should decrease the feedback frequency required to achieve the relevant DoF performance, as suggested by the outer-bou…