Showing cs.ITShow all
2 papers · 1 filter
cs.IT2026
Compression with Privacy-Preserving Random Access
Venkat Chandar, Aslan Tchamkerten, Shashank Vatedka
We show that an i.i.d.\ binary source sequence can be losslessly compressed at any rate above entropy while ensuring that the decoding of any reveals no info…
cs.IT2024
Feedback Increases the Capacity of Queues with Bounded Service Times
K. R. Sahasranand, Aslan Tchamkerten
In the "Bits Through Queues" paper, it was hypothesized that full feedback always increases the capacity of first-in-first-out queues, except when the service time distribution is…