Two-point convex-hull conjecture for the secrecy-channel curve

Let p\boldsymbol{p} range over [0,0.5][0,0.5], and define the 3D space curve

C={(p,h(ϵ+p2ϵp),h(δ+p2δp))p[0,0.5]}.\mathscr{C}=\{(p,h(\epsilon+p-2\epsilon p),h(\delta+p-2\delta p))\mid p\in [0,0.5]\}.

Two-point convex-hull conjecture. Any point in the convex hull of C\mathscr{C} can be expressed as the convex combination of only two points belonging to C\mathscr{C}. This geometric claim would imply that only two values of the parameter controlled by the auxiliary random variable are needed, and hence that the auxiliary random variable can be taken to be binary; the supplied text presents it as an unresolved conjecture supporting the binary-alphabet reduction.

Sources & referencesView supporting material

Primary source

George Amariucai and Shuangqing Wei, “Feedback-Based Collaborative Secrecy Encoding over Binary Symmetric Channels”, arXiv:0909.5120 (2009).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.