most citedMultiterminal Source Coding with Two Encoders--I: A Computable Outer Bound

4 citations · 10 across the 5 of their papers we have counts for

collaborators

7 papers

cs.NI20063 cited

A Scalable Protocol for Cooperative Time Synchronization Using Spatial Averaging

An-swol Hu, Sergio D. Servetto

Time synchronization is an important aspect of sensor network operation. However, it is well known that synchronization error accumulates over multiple hops. This presents a challe…

cs.IT2006

Lattice Quantization with Side Information: Codes, Asymptotics, and Applications in Sensor Networks

Sergio D. Servetto

We consider the problem of rate/distortion with side information available only at the decoder. For the case of jointly-Gaussian source X and side information Y, and mean-squared e…

cs.IT20061 cited

On the Role of Estimate-and-Forward with Time-Sharing in Cooperative Communications

R. Dabora, S. D. Servetto

In this work we focus on the general relay channel. We investigate the application of estimate-and-forward (EAF) to different scenarios. Specifically, we consider assignments of th…

cs.IT20064 cited

Multiterminal Source Coding with Two Encoders--I: A Computable Outer Bound

Sergio D. Servetto

In this first part, a computable outer bound is proved for the multiterminal source coding problem, for a setup with two encoders, discrete memoryless sources, and bounded distorti…

cs.IT20062 cited

An Achievability Result for the General Relay Channel

Ron Dabora, Sergio D. Servetto

See cs.IT/0605135: R. Dabora, S. D. Servetto; On the Role of Estimate-and-Forward with Time-Sharing in Cooperative Communications.

cs.IT2005

On Multiflows in Random Unit-Disk Graphs, and the Capacity of Some Wireless Networks

Christina Peraki, Sergio D. Servetto

We consider the capacity problem for wireless networks. Networks are modeled as random unit-disk graphs, and the capacity problem is formulated as one of finding the maximum value…