2 problems

Packing conjecture. Every topologically connected hypergraph can be suitably packed by minimally topologically connected hypergraphs so that invoking Lemma gives a perfect secret k…

Let $X_{\mathcal{M}}$ be a hypergraphical source, and let $R_{\mathrm{SK}}$ denote the minimum communication rate required to achieve secret-key capacity. Theorem gives an upper bo…