6 citations · 8 across the 7 of their papers we have counts for
7 papers
Group Testing on General Set-Systems
Mira Gonen, Michael Langberg, Alex Sprintson
Group testing is one of the fundamental problems in coding theory and combinatorics in which one is to identify a subset of contaminated items from a given ground set. There has be…
Minimizing the alphabet size in codes with restricted error sets
Mira Gonen, Michael Langberg, Alex Sprintson
This paper focuses on error-correcting codes that can handle a predefined set of specific error patterns. The need for such codes arises in many settings of practical interest, inc…
Minimizing the alphabet size of erasure codes with restricted decoding sets
Mira Gonen, Ishay Haviv, Michael Langberg +1
A Maximum Distance Separable code over an alphabet is defined via an encoding function that allows to retrieve a message from the codeword $…
Approximation and Heuristic Algorithms for Probabilistic Physical Search on General Graphs
Noam Hazon, Mira Gonen, Max Kleb
We consider an agent seeking to obtain an item, potentially available at different locations in a physical environment. The traveling costs between locations are known in advance,…
Coded Cooperative Data Exchange Problem for General Topologies
Mira Gonen, Michael Langberg
We consider the "coded cooperative data exchange problem" for general graphs. In this problem, given a graph G=(V,E) representing clients in a broadcast network, each of which init…
Bounding the Bias of Tree-Like Sampling in IP Topologies
Reuven Cohen, Mira Gonen, Avishai Wool
It is widely believed that the Internet's AS-graph degree distribution obeys a power-law form. Most of the evidence showing the power-law distribution is based on BGP data. However…