Sciweavers

22 search results - page 3 / 5
» Asymptotics of Input-Constrained Binary Symmetric Channel Ca...
Sort
View
65
Voted
CORR
2008
Springer
103views Education» more  CORR 2008»
14 years 10 months ago
Secret Communication with Feedback
Secure communication with feedback is studied. An achievability scheme in which the backward channel is used to generate a shared secret key is proposed. The scenario of binary sy...
Deniz Gündüz, D. Richard Brown III, H. V...
110
Voted
TIT
2010
111views Education» more  TIT 2010»
14 years 4 months ago
Directly lower bounding the information capacity for channels with I.I.D.deletions and duplications
We directly lower bound the information capacity for channels with i.i.d. deletions and duplications. Our approach differs from previous work in that we focus on the information ca...
Adam Kirsch, Eleni Drinea
CORR
2008
Springer
129views Education» more  CORR 2008»
14 years 10 months ago
Tight Bounds on the Capacity of Binary Input random CDMA Systems
Abstract-- We consider code division multiple access communication over a binary input additive white Gaussian noise channel using random spreading. For a general class of symmetri...
Satish Babu Korada, Nicolas Macris
CORR
2006
Springer
104views Education» more  CORR 2006»
14 years 10 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
MMMACNS
2001
Springer
15 years 2 months ago
Generalized Oblivious Transfer Protocols Based on Noisy Channels
The main cryptographic primitives (Bit Commitment (BC) and Oblivious Transfer (OT) protocols) based on noisy channels have been considered in [1] for asymptotic case. Non-asymptoti...
Valeri Korjik, Kirill Morozov