output
20042021
most citedClustering on Multi-Layer Graphs via Subspace Analysis on Grassmann Manifolds

219 citations

Showing cs.ITShow all

15 papers · 1 filter

cs.IT2021★ 3 cited

Simple Majority Consensus in Networks with Unreliable Communication

Ran Tamir, Ariel Livshits, Yonatan Shadmi

In this work, we analyze the performance of a simple majority-rule protocol solving a fundamental coordination problem in distributed systems - \emph{binary majority consensus}, in…

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.IT2016★ 16 cited

Two Measures of Dependence

Amos Lapidoth, Christoph Pfister

Two families of dependence measures between random variables are introduced. They are based on the Rényi divergence of order and the relative -entropy, respectively, and bot…

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.IT2014★ 60 cited

Encoding Tasks and Rényi Entropy

Christoph Bunte, Amos Lapidoth

A task is randomly drawn from a finite set of tasks and is described using a fixed number of bits. All the tasks that share its description must be performed. Upper and lower bound…

cs.IT2013★ 10 cited

On the Listsize Capacity with Feedback

Christoph Bunte, Amos Lapidoth

The listsize capacity of a discrete memoryless channel is the largest transmission rate for which the expectation---or, more generally, the -th moment---of the number of message…

cs.IT2013★ 16 cited

The Zero-Undetected-Error Capacity Approaches the Sperner Capacity

Christoph Bunte, Amos Lapidoth, Alex Samorodnitsky

Ahlswede, Cai, and Zhang proved that, in the noise-free limit, the zero-undetected-error capacity is lower bounded by the Sperner capacity of the channel graph, and they conjecture…

cs.IT2009★ 2 cited

On the Gaussian MAC with Imperfect Feedback

Amos Lapidoth, Michele A. Wigger

New achievable rate regions are derived for the two-user additive white Gaussian multiple-access channel with noisy feedback. The regions exhibit the following two properties. Irre…

cs.IT2009★ 68 cited

Sending a Bi-Variate Gaussian over a Gaussian MAC

Amos Lapidoth, Stephan Tinguely

We study the power versus distortion trade-off for the distributed transmission of a memoryless bi-variate Gaussian source over a two-to-one average-power limited Gaussian multiple…

cs.IT2009★ 10 cited

Simple Channel Coding Bounds

Ligong Wang, Roger Colbeck, Renato Renner

New channel coding converse and achievability bounds are derived for a single use of an arbitrary channel. Both bounds are expressed using a quantity called the "smooth 0-divergenc…

cs.IT2007★ 67 cited

Low SNR Capacity of Noncoherent Fading Channels

Vignesh Sethuraman, Ligong Wang, Bruce Hajek +1

Discrete-time Rayleigh fading single-input single-output (SISO) and multiple-input multiple-output (MIMO) channels are considered, with no channel state information at the transmit…

cs.IT2006

Sending a Bi-Variate Gaussian Source over a Gaussian MAC

Amos Lapidoth, Stephan Tinguely

We consider a problem where a memoryless bi-variate Gaussian source is to be transmitted over an additive white Gaussian multiple-access channel with two transmitting terminals and…

cs.IT2006★ 5 cited

Superimposed Coded and Uncoded Transmissions of a Gaussian Source over the Gaussian Channel

Shraga Bross, Amos Lapidoth, Stephan Tinguely

We propose to send a Gaussian source over an average-power limited additive white Gaussian noise channel by transmitting a linear combination of the source sequence and the result…

cs.IT2005

Asymptotic Capacity Results for Non-Stationary Time-Variant Channels Using Subspace Projections

Thomas Zemen, Stefan M. Moser

In this paper we deal with a single-antenna discrete-time flat-fading channel. The fading process is assumed to be stationary for the duration of a single data block. From block to…

cs.IT2004★ 32 cited

Monotonicity Results for Coherent MIMO Rician Channels

Daniel Hoesli, Young-Han Kim, Amos Lapidoth

The dependence of the Gaussian input information rate on the line-of-sight (LOS) matrix in multiple-input multiple-output coherent Rician fading channels is explored. It is proved…