Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let p and q be the crossover probabilities of the teacher's and student's binary symmetric channels, respectively, with 0<p,q<1/2. Let D(a|b) denote the binary relative entropy, and let the optimal learning rate be the supremum over all…
Let Upsilon be the admissible constellation region for a single-subcarrier IM/DD system, let Omegathissubset Upsilon be a constellation, and let nu_hat P_o be its normalized peak-optical-power SNR measure. Let E_2 denote the two-point…
Let X_[m]=(X_1,…,X_m) be a multiterminal source model with m≥ 3 terminals. Let omnivocal communication mean communication in which every terminal communicates, and let the singleton partition be the partition 1,…,m; write I(X_[m]) for the…
Let E_p^2 be an entropoid and let g∈E^*_(p-1)^2 generate its maximal multiplicative subgroupoid. For every even base b=2b_1<b_max, let n(b,i)=max n_ij. The even-base min-entropy conjecture. n(b,i)=(b-1)((b-1)^i-1-(b-2)^i-1), and…
Let D(t):= Q∈C^t× t| Q≥ 0,tr(Q)≤ 1 and let (H_i)_1≤ i≤ t be independent and identically distributed as N_C(0,1). Write H=(H_1,…,H_t) and let U(t) denote the group of t× t unitary matrices. For every x∈R_+, there exists k∈1,…,t such that…
Let X_1 and X_2 be binary classical random variables with quantum side-information systems B_1 and B_2, respectively, and let ρ^X_1B_1 and ρ^X_2B_2 be classical-quantum states. Define H_1=H(X_1|B_1), H_2=H(X_2|B_2). Here, h is the binary…
Let d≥ 2 and let M(Δ,d) denote the penalty function defined by the minimization over pairs of distributions with entropy difference Δ. For Δ∈[0,log d], symmetry inequality conjecture. M(Δ,d)≥ M(-Δ,d). Numerical plots for many values of d…
Let X~Unif(H^n) be uniformly distributed on the Boolean hypercube, and let Y be obtained by passing each bit of X through a binary symmetric channel with crossover probability p=(1-ρ)/2∈[0,1]. Let f:H^n↦H be a Boolean function, and let…
For a partially fixed-size network, let k_1 be the default alphabet size for default-size messages and k_2 the default alphabet size for default-size edges. Let k_1^*(k_2) be the largest possible k_1 for fixed k_2 such that the network…
Let c be the coalition size, let z denote the number of colluders receiving symbol 1, let y∈0,1 be the pirate output, and let p be the bias parameter. Define the score function g(z, y, p) = ln(1 - z/c) - ln(1 - p) (y = 0) ln(z/c) - ln(p)…
Let q and tilde q be the distributions produced by the inner-loop optimization, and let η and tildeη be the corresponding expectation parameters for the marginal distributions on Y and Z. The quantities |tilde q-q|_∞ and |tildeη-η|_1…
Let X,Y,Z have the distribution specified in the source, with Z determined by X and Y according to the displayed table. For N≥1, let overlineY^N be any binary output of a binarization channel applied to Y^N, and let overlineZ^N be an…
Let A^∞ be the space of one-sided infinite sequences over the alphabet A, with shift operator T. Let μ be a computable ergodic T-invariant measure, and define h^μ_n(Z)=-1/nlogμ[Zupharpoonright_n]. Write H(μ)=lim_n H_n(μ) for the entropy of…
Consider the two-user binary adder channel with complete feedback, and let R( O_f) denote its average zero-error capacity. Binary adder-channel conjecture. The average zero-error capacity is R( O_f)=0.78974. The paper states that the…
Let a sum-network have m=n=3, where m is the number of sources and n is the number of terminals, and let its capacity be the supremum of the achievable communication rates for computing the sum of the source messages at every terminal.…
Consider the K-user quasi-static scalar fading broadcast channel without transmit CSI, Y_k = √A_kX + Z_k, k=1,…,K, where Z_k ~ CN(0,1)), X has average power constraint ρ, each A_k is constant over the coding block and known only at decoder…
Let bf F_1 and bf F_2 be the linear encoding matrices, with bf F_2 of the form specified in. Let α be the objective-weight parameter, let σ_1^2 and σ_2^2 be the users' noise variances, and let bf B be the symmetric matrix in the…
For a prime-power alphabet size q≥2 and a parameter β∈(0,1/2], define g_0(x)=(x(1-x))^β. Let λ_m denote the mixing-rate quantity used in the source, namely λ_m=sup_x∈[0,1]fracoverlineg_1(x)g_0(x). Asymptotic mixing-rate conjecture.…
For each n≥ 3, consider the p-Stam inequality for monic real-rooted pairs of degree n, with critical exponent denoted by p^*. p-Stam phase transition conjecture. For all n≥ 3, the p-Stam inequality holds for all monic real-rooted pairs if…
Let Λ be a formally unimodular lattice, with secrecy function Ξ_Λ(τ), and denote its secrecy gain by ξ_Λ. Formally unimodular secrecy-gain conjecture. The secrecy function of Λ achieves its maximum at τ=1, namely ξ_Λ=Ξ_Λ(1). The conjecture…