activity
20052022
most citedWireless Network Information Flow: A Deterministic Approach

855 citations · 2.9k across the 86 of their papers we have counts for

collaborators
Showing cs.ITShow all

57 papers · 1 filter

cs.IT2017

Two-Way Interference Channel Capacity: How to Have the Cake and Eat it Too

Changho Suh, Jaewoong Cho, David Tse

Two-way communication is prevalent and its fundamental limits are first studied in the point-to-point setting by Shannon [1]. One natural extension is a two-way interference channe…

cs.IT2017

Polar Coding for Parallel Gaussian Channel

David Tse, Bin Li, Kai Chen

In this paper, we propose a Polar coding scheme for parallel Gaussian channels. The encoder knows the sum rate of the parallel channels but does not know the rate of any channel. B…

cs.IT2017★ 4 cited

Fundamental Limits of DNA Storage Systems

Reinhard Heckel, Ilan Shomorony, Kannan Ramchandran +1

Due to its longevity and enormous information density, DNA is an attractive medium for archival storage. In this work, we study the fundamental limits and tradeoffs of DNA-based st…

cs.IT2016

Partial DNA Assembly: A Rate-Distortion Perspective

Ilan Shomorony, Govinda M. Kamath, Fei Xia +2

Earlier formulations of the DNA assembly problem were all in the context of perfect assembly; i.e., given a set of reads from a long genome sequence, is it possible to perfectly re…

cs.IT2016★ 19 cited

Community Recovery in Graphs with Locality

Yuxin Chen, Govinda Kamath, Changho Suh +1

Motivated by applications in domains such as social networks and computational biology, we study the problem of community recovery in graphs with locality. In this problem, pairwis…

cs.IT2015★ 4 cited

Capacity-Achieving Rateless Polar Codes

Bin Li, David Tse, Kai Chen +1

A rateless coding scheme transmits incrementally more and more coded bits over an unknown channel until all the information bits are decoded reliably by the receiver. We propose a…