most citedOptimal coding for the deletion channel with small deletion probability

6 citations · 6 across the 2 of their papers we have counts for

collaborators
Showing cs.MAShow all

1 paper · 1 filter

cs.MA2011

Subexponential convergence for information aggregation on regular trees

Yashodhan Kanoria, Andrea Montanari

We consider the decentralized binary hypothesis testing problem on trees of bounded degree and increasing depth. For a regular tree of depth t and branching factor k>=2, we assume…