Sciweavers

38 search results - page 2 / 8
» Commitment Capacity of Discrete Memoryless Channels
Sort
View
TIT
2011
124views more  TIT 2011»
13 years 3 months ago
On the Equivalence of Two Achievable Regions for the Broadcast Channel
—A recent inner bound on the capacity region of the two-receiver discrete memoryless broadcast channel is shown to be equivalent to the Marton-Gelfand-Pinsker region. The proof m...
Yingbin Liang, Gerhard Kramer, H. Vincent Poor
ICC
2009
IEEE
135views Communications» more  ICC 2009»
13 years 6 months ago
A Discrete Channel Model for Capturing Memory and Soft-Decision Information: A Capacity Study
A discrete (binary-input 2q -ary output) communication channel with memory is introduced with the objective to judiciously capture both the statistical memory and the soft-decision...
Cecilio Pimentel, Fady Alajaji
CORR
2008
Springer
104views Education» more  CORR 2008»
13 years 9 months ago
Secrecy capacity of a class of orthogonal relay eavesdropper channels
The secrecy capacity is developed for a class of relay channels with orthogonal components and a passive eavesdropper node. The relay and destination receive signals from the sourc...
Vaneet Aggarwal, Lalitha Sankar, A. Robert Calderb...
TIT
1998
81views more  TIT 1998»
13 years 8 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
CORR
2010
Springer
101views Education» more  CORR 2010»
13 years 9 months ago
Probing Capacity
We consider the problem of optimal probing of states of a channel by transmitter and receiver for maximizing rate of reliable communication. The channel is discrete memoryless (DM...
Himanshu Asnani, Haim H. Permuter, Tsachy Weissman