77 citations · 179 across the 54 of their papers we have counts for
7 papers · 1 filter
Secure Private and Adaptive Matrix Multiplication Beyond the Singleton Bound
Christoph Hofmeister, Rawad Bitar, Marvin Xhemrishi +1
We consider the problem of designing secure and private codes for distributed matrix-matrix multiplication. A master server owns two private matrices and hires worker nodes to help…
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…
Function-Correcting Codes
Andreas Lenz, Rawad Bitar, Antonia Wachter-Zeh +1
In this paper we study function-correcting codes, a new class of codes designed to protect the function evaluation of a message against errors. We show that FCCs are equivalent to…
Multiple Criss-Cross Insertion and Deletion Correcting Codes
Lorenz Welter, Rawad Bitar, Antonia Wachter-Zeh +1
This paper investigates the problem of correcting multiple criss-cross insertions and deletions in arrays. More precisely, we study the unique recovery of arrays affec…