{"ID":2840073,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2511.14524","arxiv_id":"2511.14524","title":"Compression with Privacy-Preserving Random Access","abstract":"It is shown that an i.i.d. binary source sequence $X_1, \\ldots, X_n$ can be losslessly compressed at any rate above entropy such that the individual decoding of any $X_i$ reveals \\emph{no} information about the other bits $\\{X_j : j \\neq i\\}$.","short_abstract":"It is shown that an i.i.d. binary source sequence $X_1, \\ldots, X_n$ can be losslessly compressed at any rate above entropy such that the individual decoding of any $X_i$ reveals \\emph{no} information about the other bits $\\{X_j : j \\neq i\\}$.","url_abs":"https://arxiv.org/abs/2511.14524","url_pdf":"https://arxiv.org/pdf/2511.14524v1","authors":"[\"Venkat Chandar\",\"Aslan Tchamkerten\",\"Shashank Vatedka\"]","published":"2025-11-18T14:24:25Z","proceeding":"cs.IT","tasks":"[\"cs.IT\",\"cs.CR\",\"cs.DS\"]","methods":"[]","has_code":false}