Sciweavers

39 search results - page 2 / 8
» Error exponents of expander codes
Sort
View
DCC
2006
IEEE
14 years 4 months ago
Time-Sharing Vs. Source-Splitting in the Slepian-Wolf Problem: Error Exponents Analysis
We discuss two approaches for decoding at arbitrary rates in the Slepian-Wolf problem - time sharing and source splitting - both of which rely on constituent vertex decoders. We c...
Michelle Effros, Muriel Médard, Todd P. Col...
CORR
2006
Springer
67views Education» more  CORR 2006»
13 years 5 months ago
Error Exponents and Cutoff Rate for Noncoherent Rician Fading Channels
In this paper, random coding error exponents and cutoff rate are studied for noncoherent Rician fading channels, where neither the receiver nor the transmitter has channel side inf...
Mustafa Cenk Gursoy
TIT
2002
86views more  TIT 2002»
13 years 4 months ago
A low-rate bound on the reliability of a quantum discrete memoryless channel
We extend a low-rate improvement of the random coding bound on the reliability of a classical discrete memoryless channel (DMC) to its quantum counterpart. The key observation that...
Alexander Barg
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 5 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