49 citations · 101 across the 20 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2022
Upper bounds on the Rate of Uniformly-Random Codes for the Deletion Channel
Berivan Isik, Francisco Pernice, Tsachy Weissman
We consider the maximum coding rate achievable by uniformly-random codes for the deletion channel. We prove an upper bound that's within 0.1 of the best known lower bounds for all…
cs.IT2022
Lossy Compression of Noisy Data for Private and Data-Efficient Learning
Berivan Isik, Tsachy Weissman
Storage-efficient privacy-preserving learning is crucial due to increasing amounts of sensitive user data required for modern learning tasks. We propose a framework for reducing th…