Sciweavers

38 search results - page 7 / 8
» Commitment Capacity of Discrete Memoryless Channels
Sort
View
TIT
2010
300views Education» more  TIT 2010»
13 years 1 months ago
Polar codes are optimal for lossy source coding
We consider lossy source compression of a binary symmetric source using polar codes and the low-complexity successive encoding algorithm. It was recently shown by Arikan that polar...
Satish Babu Korada, Rüdiger L. Urbanke
ICC
2008
IEEE
125views Communications» more  ICC 2008»
14 years 1 months ago
Iteratively Detected Sphere Packing Modulated OFDM: An Exit Chart Perspective
- A novel iteratively detected Sphere Packing (SP) modulation aided Orthogonal Frequency Division Multiplexing (OFDM) scheme is proposed, which we refer to as the SPOFDM arrangemen...
Lei Xu, Mohammed El-Hajjar, Osamah Alamri, Sheng C...
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 6 months ago
Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions
An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext,...
Ying Wang, Pierre Moulin
CORR
2007
Springer
110views Education» more  CORR 2007»
13 years 6 months ago
Relations between random coding exponents and the statistical physics of random codes
The partition function pertaining to finite–temperature decoding of a (typical) randomly chosen code is known to have three types of behavior, corresponding to three phases in ...
Neri Merhav
CORR
2007
Springer
156views Education» more  CORR 2007»
13 years 6 months ago
Analysis of a Mixed Strategy for Multiple Relay Networks
Abstract— Infrastructure based wireless communications systems as well as ad hoc networks experience a growing importance in present-day telecommunications. An increased density ...
Peter Rost, Gerhard Fettweis