activity
20072013
most citedInformation-Theoretic Bounds for Multiround Function Computation in Collocated Networks

45 citations · 120 across the 9 of their papers we have counts for

collaborators

9 papers

cs.IT2013★ 4 cited

Optimal DNA shotgun sequencing: Noisy reads are as good as noiseless reads

Abolfazl Motahari, Kannan Ramchandran, David Tse +1

We establish the fundamental limits of DNA shotgun sequencing under noisy reads. We show a surprising result: for the i.i.d. DNA model, noisy reads are as good as noiseless reads,…

cs.IT2012★ 18 cited

A Compression Algorithm Using Mis-aligned Side-information

Nan Ma, Kannan Ramchandran, David Tse

We study the problem of compressing a source sequence in the presence of side-information that is related to the source via insertions, deletions and substitutions. We propose a si…

cs.IT2011★ 31 cited

Efficient File Synchronization: a Distributed Source Coding Approach

Nan Ma, Kannan Ramchandran, David Tse

The problem of reconstructing a source sequence with the presence of decoder side-information that is mis-synchronized to the source due to deletions is studied in a distributed so…

cs.IT2010★ 3 cited

Interaction Strictly Improves the Wyner-Ziv Rate-distortion function

Nan Ma, Prakash Ishwar

In 1985 Kaspi provided a single-letter characterization of the sum-rate-distortion function for a two-way lossy source coding problem in which two terminals send multiple messages…

cs.IT2010

Infinite-message Interactive Function Computation in Collocated Networks

Nan Ma, Prakash Ishwar

An interactive function computation problem in a collocated network is studied in a distributed block source coding framework. With the goal of computing a desired function at the…

cs.IT2009★ 1 cited

The Infinite-message Limit of Two-terminal Interactive Source Coding

Nan Ma, Prakash Ishwar

A two-terminal interactive function computation problem with alternating messages is studied within the framework of distributed block source coding theory. For any finite number o…