Sciweavers

38 search results - page 5 / 8
» Commitment Capacity of Discrete Memoryless Channels
Sort
View
GLOBECOM
2006
IEEE
14 years 23 days ago
Relay Channel with Private Messages
Abstract—The relay channel with private messages (RCPM) is a generalized relay channel model where in addition to the traditional communication from source to destination (assist...
Ramy Tannious, Aria Nosratinia
CORR
2006
Springer
104views Education» more  CORR 2006»
13 years 6 months ago
Asymptotically Optimal Multiple-access Communication via Distributed Rate Splitting
We consider the multiple-access communication problem in a distributed setting for both the additive white Gaussian noise channel and the discrete memoryless channel. We propose a ...
Jian Cao, Edmund M. Yeh
CORR
2008
Springer
159views Education» more  CORR 2008»
13 years 6 months ago
Compound Multiple Access Channels with Partial Cooperation
A two-user discrete memoryless compound multiple access channel with a common message and conferencing decoders is considered. The capacity region is characterized in the special ...
Osvaldo Simeone, Deniz Gündüz, H. Vincen...
ICASSP
2009
IEEE
13 years 10 months ago
Geometrical interpretation and improvements of the Blahut-Arimoto's algorithm
The paper first recalls the Blahut Arimoto algorithm for computing the capacity of arbitrary discrete memoryless channels, as an example of an iterative algorithm working with pro...
Ziad Naja, Florence Alberge, Pierre Duhamel
TIT
2011
97views more  TIT 2011»
13 years 1 months ago
Error Exponents for the Gaussian Channel With Active Noisy Feedback
We study the best exponential decay in the blocklength of the probability of error that can be achieved in the transmission of a single bit over the Gaussian channel with an activ...
Young-Han Kim, Amos Lapidoth, Tsachy Weissman