Sciweavers

118 search results - page 6 / 24
» Bounds on mutual information for simple codes using informat...
Sort
View
TCOM
2010
114views more  TCOM 2010»
13 years 2 months ago
Achieving near-capacity performance on multiple-antenna channels with a simple concatenation scheme
This paper proposes a capacity-approaching, yet simple scheme for multi-input multiple-output (MIMO) channels. The proposed scheme is based on a concatenation of a mixture of short...
Nghi H. Tran, Tho Le-Ngoc, Tad Matsumoto, Ha H. Ng...
VTC
2010
IEEE
140views Communications» more  VTC 2010»
13 years 5 months ago
Superposition Coding Aided Bi-Directional Relay Transmission Employing Iteratively Decoded Self-Concatenated Convolutional Codes
— In this paper, we consider coding schemes designed for two nodes communicating with each other with the aid of a relay node, which receives information from the two nodes in th...
Muhammad Fasih Uddin Butt, Rong Zhang, Soon Xin Ng...
EUROCRYPT
1995
Springer
13 years 11 months ago
Quantum Oblivious Mutual Identification
We coiisider a situation where two parties, Alice and Bob, share a common secret string arid would like to mutually check their knowledge of that string. We describe a simple and e...
Claude Crépeau, Louis Salvail
ESAS
2007
Springer
14 years 1 months ago
Distance Bounding in Noisy Environments
Location information can be used to enhance mutual entity authentication protocols in wireless ad-hoc networks. More specifically, distance bounding protocols have been introduced...
Dave Singelée, Bart Preneel
CORR
2006
Springer
136views Education» more  CORR 2006»
13 years 7 months ago
On the Capacity of Multiple Access Channels with State Information and Feedback
In this correspondence, the multiple access channel (MAC) with channel state is analyzed in a scenario where a) the channel state is known non-causally to the transmitters and b) t...
Wei Wu, Sriram Vishwanath, Ari Arapostathis