Sciweavers

64 search results - page 5 / 13
» The Shannon Capacity of a Union
Sort
View
TIT
2010
99views Education» more  TIT 2010»
13 years 2 months ago
Capacity of Channels With Action-Dependent States
We consider channels with action-dependent states: Given the message to be communicated, the transmitter chooses an action sequence that affects the formation of the channel state...
Tsachy Weissman
GLOBECOM
2008
IEEE
14 years 2 months ago
Generalized Capacity and Source-Channel Coding for Packet Erasure Channels
— We study the transmission of a stationary ergodic Gaussian source over a packet erasure channel, which is a composite channel with degraded states. A broadcast channel code can...
Yifan Liang, Andrea J. Goldsmith, Michelle Effros
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 7 months ago
The price of certainty: "waterslide curves" and the gap to capacity
The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the total power consumption small. ...
Anant Sahai, Pulkit Grover
VTC
2006
IEEE
129views Communications» more  VTC 2006»
14 years 1 months ago
Practicable MIMO Capacity in Ideal Channels
— The impact of communications signal processing such as QAM modulations (instead of gaussian signals), finite block lengths (instead of infinitely long codes), and using simpl...
S. Amir Mirtaheri, Rodney G. Vaughan
STOC
1994
ACM
134views Algorithms» more  STOC 1994»
13 years 11 months ago
A coding theorem for distributed computation
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
Sridhar Rajagopalan, Leonard J. Schulman