2 problems

0 votes0 replies0 views
Villard–Pianta's optimality conjecture for non-degraded secure source coding
Villard–Pianta's optimality conjecture. Their achievability is optimal in the non-degraded case.
Conjectureopeninformation-theory secure-source-codingarXiv posted 2 days ago
0 votes0 replies0 views
Optimality of the uncoded side-information inner bound for weaker legitimate side information
Let $C$ and $E$ denote Bob's and Eve's side information, respectively, and let $\rho_C$ and $\rho_E$ be their correlation parameters with the source. In the uncoded-side-informatio…
Conjectureopeninformation-theory secure-source-coding side-informationarXiv posted 2 days ago

Villard–Pianta's optimality conjecture for non-degraded secure source coding