Sciweavers

225 search results - page 28 / 45
» Capacity Bounds for Sticky Channels
Sort
View
TIT
2008
80views more  TIT 2008»
13 years 8 months ago
Entropy Amplification Property and the Loss for Writing on Dirty Paper
Costa's celebrated "writing on dirty paper" (WDP) shows that the powerconstrained channel Y = X + S + Z, with Gaussian Z, has the same capacity as the standard AWGN...
Aaron S. Cohen, Ram Zamir
CSFW
2012
IEEE
11 years 11 months ago
Measuring Information Leakage Using Generalized Gain Functions
Abstract—This paper introduces g-leakage, a rich generalization of the min-entropy model of quantitative information flow. In g-leakage, the benefit that an adversary derives f...
Mário S. Alvim, Konstantinos Chatzikokolaki...
TIT
2002
64views more  TIT 2002»
13 years 8 months ago
An information-theoretic and game-theoretic study of timing channels
This paper focuses on jammed timing channels. Pure delay jammers with a maximum delay constraint, an average delay constraint, or a maximum buffer size constraint are explored, for...
James Giles, Bruce Hajek
TIT
2002
78views more  TIT 2002»
13 years 8 months ago
Optimal placement of training for frequency-selective block-fading channels
The problem of placing training symbols optimally for orthogonal frequency-division multiplexing (OFDM) and single-carrier systems is considered. The channel is assumed to be quasi...
Srihari Adireddy, Lang Tong, Harish Viswanathan
VTC
2007
IEEE
148views Communications» more  VTC 2007»
14 years 2 months ago
Iteratively Detected Irregular Variable Length Coding and Sphere-Packing Modulation-Aided Differential Space-Time Spreading
Abstract— In this paper we consider serially concatenated and iteratively decoded Irregular Variable Length Coding (IrVLC) combined with precoded Differential Space-Time Spreadin...
Mohammed El-Hajjar, Robert G. Maunder, Osamah Alam...