Sciweavers

TIT
1998
89views more  TIT 1998»
13 years 4 months ago
The Common Randomness Capacity of a Pair of Independent Discrete Memoryless Channels
—We study the following problem: two agents Alice and Bob are connected to each other by independent discrete memoryless channels. They wish to generate common randomness, i.e., ...
Sivarama Venkatesan, Venkat Anantharam
TIT
1998
81views more  TIT 1998»
13 years 4 months ago
Fast Iterative Coding Techniques for Feedback Channels
Abstract—A class of capacity-achieving, low-complexity, highreliability, variable-rate coding schemes is developed for communication over discrete memoryless channels with noisel...
James M. Ooi, Gregory W. Wornell
TIT
2008
100views more  TIT 2008»
13 years 4 months ago
Communication Via Decentralized Processing
Abstract-- The common problem of a nomadic terminal sending information to a remote destination via agents with lossless connections is investigated. Such a setting suits, e.g. acc...
Amichai Sanderovich, Shlomo Shamai, Yossef Steinbe...