activity
20122017
most citedIdentification via the Broadcast Channel

22 citations · 23 across the 5 of their papers we have counts for

collaborators

8 papers

cs.IT2017★ 1 cited

Distributed Task Encoding

Annina Bracher, Amos Lapidoth, Christoph Pfister

The rate region of the task-encoding problem for two correlated sources is characterized using a novel parametric family of dependence measures. The converse uses a new expression…

cs.IT2017

Guessing Attacks on Distributed-Storage Systems

Annina Bracher, Eran Hof, Amos Lapidoth

The secrecy of a distributed-storage system for passwords is studied. The encoder, Alice, observes a length-n password and describes it using two hints, which she stores in differe…

cs.IT2016

The Zero-Error Feedback Capacity of State-Dependent Channels

Annina Bracher, Amos Lapidoth

The zero-error feedback capacity of the Gelfand-Pinsker channel is established. It can be positive even if the channel's zero-error capacity is zero in the absence of feedback. Mor…

cs.IT2016★ 22 cited

Identification via the Broadcast Channel

Annina Bracher, Amos Lapidoth

The identification (ID) capacity region of the two-receiver broadcast channel (BC) is shown to be the set of rate-pairs for which, for some distribution on the channel input, each…

cs.IT2015

Feedback and Partial Message Side-Information on the Semideterministic Broadcast Channel

Annina Bracher, Michèle Wigger

The capacity of the semideterministic discrete memoryless broadcast channel (SD-BC) with partial message side-information (P-MSI) at the receivers is established. In the setting wi…

cs.IT2014

Distributed Storage for Data Security

Annina Bracher, Eran Hof, Amos Lapidoth

We study the secrecy of a distributed storage system for passwords. The encoder, Alice, observes a length-n password and describes it using two hints, which she then stores in diff…

cs.IT2014

Decoding binary node labels from censored edge measurements: Phase transition and efficient recovery

Emmanuel Abbe, Afonso S. Bandeira, Annina Bracher +1

We consider the problem of clustering a graph into two communities by observing a subset of the vertex correlations. Specifically, we consider the inverse problem with observed…

cs.IT2012

Probabilistic Recovery Guarantees for Sparsely Corrupted Signals

Graeme Pope, Annina Bracher, Christoph Studer

We consider the recovery of sparse signals subject to sparse interference, as introduced in Studer et al., IEEE Trans. IT, 2012. We present novel probabilistic recovery guarantees…