4 problems

Consider a channel reconstruction problem on a tree. Symmetric-binary optimality conjecture. The phenomenon that global majority achieves the same reconstruction threshold as maxim…

Let $q$ be the input alphabet size and $L$ the output alphabet size. Suppose the algorithm in Tal, Sharov, and Vardy has a power-law bound of order $L^{-1/(q-1)}$. Improved power-l…

Constant-composition achievability conjecture. Constant-composition codes can approach the maximization in equation $$ with a small gap.

Optimality conjecture. If $K<L-1$, then there is always a channel $W\in\mathcal W([L],[L'])$ satisfying $W(\delta_i)\neq W(\delta_j)$ for all distinct $i,j\in[L]$ such that…