MathDB2 problems
- 0 votes0 replies0 views
Optimality of the straightforward Gelfand–Pinsker scheme for compound channels
Optimality conjecture. The straightforward extension of the Gelfand–Pinsker achievability scheme to the compound channel problem is optimum.
- 0 votes0 replies0 views
Pareto-frontier conjecture for the opportunistic error exponent region
Pareto-frontier conjecture. No coding scheme can achieve a better error exponent; equivalently, the displayed vector is the Pareto frontier of the error-exponent region.