7 citations · 11 across the 6 of their papers we have counts for
11 papers · 1 filter
Distributed Matrix-Vector Multiplication with Sparsity and Privacy Guarantees
Marvin Xhemrishi, Rawad Bitar, Antonia Wachter-Zeh
We consider the problem of designing a coding scheme that allows both sparsity and privacy for distributed matrix-vector multiplication. Perfect information-theoretic privacy requi…
Optimal Codes Correcting Localized Deletions
Rawad Bitar, Serge Kas Hanna, Nikita Polyanskii +1
We consider the problem of constructing codes that can correct deletions that are localized within a certain part of the codeword that is unknown a priori. Namely, the model that w…
Detecting Deletions and Insertions in Concatenated Strings with Optimal Redundancy
Serge Kas Hanna, Rawad Bitar
We study codes that can detect the exact number of deletions and insertions in concatenated binary strings. We construct optimal codes for the case of detecting up to $\del$ deleti…
Network Coding with Myopic Adversaries
Sijie Li, Rawad Bitar, Sidharth Jaggi +1
We consider the problem of reliable communication over a network containing a hidden {\it myopic} adversary who can eavesdrop on some links, jam some links, and d…
Adaptive Private Distributed Matrix Multiplication
Rawad Bitar, Marvin Xhemrishi, Antonia Wachter-Zeh
We consider the problem of designing codes with flexible rate (referred to as rateless codes), for private distributed matrix-matrix multiplication. A master server owns two privat…
Rateless Codes for Private Distributed Matrix-Matrix Multiplication
Rawad Bitar, Marvin Xhemrishi, Antonia Wachter-Zeh
We consider the problem of designing rateless coded private distributed matrix-matrix multiplication. A master server owns two private matrices and and wa…