1,234 problems
- 0 votes0 replies1 view
Courtade–Kumar conjecture on noise stability of Boolean functions
Let be uniformly distributed on the Boolean hypercube , and let be obtained by transmitting through a memoryless binary symmetric channel with crossover p…
- 0 votes0 replies1 view
Friedgut–Kalai Fourier entropy-influence conjecture for Boolean functions
Let be a Boolean function. Its Fourier entropy is the Shannon entropy of its power spectrum , and its…
- 0 votes0 replies0 views
Cuff's conjecture on strong and empirical coordination regions
Cuff's conjecture. With enough common randomness, the strong coordination region is the same as the empirical coordination region for any network setting.
- 0 votes0 replies0 views
Shepp–Olkin entropy concavity conjecture
Let be independent Bernoulli random variables with parameters , let , and let denote the Shannon entropy…
- 0 votes0 replies0 views
Cover's conjecture on feedback capacity under doubled power
Cover's conjecture. The feedback capacity is at most as large as the nonfeedback capacity under twice the power:
- 0 votes0 replies0 views
Freij-Hollanti et al.'s MDS-TPIR capacity conjecture
Let files be stored across servers, with each file stored independently using the same -MDS code. A user wants to retrieve one file without revealing its index to an…
- 0 votes0 replies0 views
Two-point minimizer conjecture for the Gaussian mean–variance constrained channel
Let be the minimum of over probability distributions on with mean and variance , where is the standard…
- 0 votes0 replies0 views
Ball–Nayar–Tkocz conjecture on entropy concavity for Gaussian mixtures
Let and be independent identically distributed log-concave random variables in dimension , and let denote differential entropy. Ball–Nayar–Tkocz conjecture. The map…
- 0 votes0 replies0 views
Ver's MMSE conjecture in Gaussian-channel form
MMSE conjecture. If
- 0 votes0 replies0 views
Super-exponential codebook-size conjecture for continuous-alphabet channels
Super-exponential codebook-size conjecture. The codebook size for any continuous-alphabet channel should be a super-exponential function of , namely
- 0 votes0 replies0 views
The no network-coding gain conjecture for undirected unicast networks
No network-coding gain conjecture. Network coding has no rate benefit over routing in undirected unicast networks.
- 0 votes0 replies0 views
Courtade–Kumar most informative Boolean function conjecture
Let be uniformly distributed on , let be obtained from through a memoryless binary symmetric channel with crossover probability , and let…
- 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
Capacity conjecture for symmetric PIR from MDS-coded storage with adversarial servers
Let an MDS storage code store a database accessed by a Symmetric Private Information Retrieval scheme, with -colluding servers, Byzantine servers, and unresponsi…
- 0 votes0 replies0 views
Extension of the analytical results to correlated channels
Extension conjecture. The analytical results can be extended to the case of correlated channels.
- 0 votes0 replies1 view
Rényi divergence and generalized channel capacity relation
Let be a non-uniform distribution and the uniform distribution on a support of cardinality . Let be the matrix with two rows, and , and columns. The q…
- 0 votes0 replies0 views
Steel's conjecture on tree model estimation in the Kesten–Stigum regime
Steel's conjecture. In the Ising model, in the Kesten–Stigum regime, high-probability tree model estimation may be achieved with samples.
- 0 votes0 replies0 views
Capacity conjecture for triply-noisy channels
Let a triply-noisy channel have substitution, insertion, and deletion parameters , , and , respectively, and let denote the binary entropy function.…
- 0 votes0 replies1 view
Phase transition in LAWS convergence
Let be a stationary distribution with entropy , let denote the LAWS hit rate after total queries, and let be the per-node visit threshold.…
- 0 votes0 replies0 views
Csiszár–Narayan conjecture on the multi-letter LM characterization of mismatch capacity
Csiszár–Narayan conjecture. The mismatch capacity under the maximum-metric decoder for discrete-memoryless channels and product decoding metrics is given by the limiting multi-lett…
- 0 votes0 replies0 views
Tightness of the upper bound for deterministic identification over Gaussian channels
Tightness conjecture. The upper bound on the linearithmic capacity of deterministic identification over additive white Gaussian noise channels should be tight, and the use of typic…
- 0 votes0 replies0 views
Sharma–Shamai conjecture on support growth for the amplitude-constrained AWGN channel
Let be the unique capacity-achieving input distribution for the amplitude-constrained AWGN channel with peak-amplitude constraint . As increases, consider the s…
- 0 votes0 replies0 views
Information-theoretic impossibility of recovery under sublinear sparsification
Information-theoretic impossibility conjecture. Recovery is information-theoretically impossible no matter the sample size in the sub-linear sparsification regime where .
- 0 votes0 replies1 view
Non-achievability conjecture for the optimal individual key rate when all users contact all relays
Let and let , so that every user is connected to every relay. A rate tuple is written as , with the components denoting the comm…
- 0 votes0 replies0 views
The most-informative Boolean function conjecture
Let be uniformly distributed on the Boolean hypercube, and let be obtained by passing each bit of throug…