Abstract:We show that an i.i.d.\ binary source sequence $X_1,\ldots,X_n$ can be losslessly compressed at any rate above entropy while ensuring that the decoding of any $X_i$ reveals no information about the remaining symbols $\{X_j : j \neq i\}$.
This problem reduces to a marginal consistency problem induced by the simultaneous privacy and reliability constraints. To address it, we develop a technique based on a geometric representation of codeword distributions, which may be of independent interest.
From: Shashank Vatedka [view email]
[v1]
Tue, 18 Nov 2025 14:24:25 UTC (270 KB)
[v2]
Fri, 10 Jul 2026 16:32:01 UTC (307 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。