39 search results - page 2 / 8 » Error exponents of expander codes |
102
Voted
DCC
2006
IEEE
16 years 2 months ago
2006
IEEE
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...
87
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
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...
111
Voted
TIT
2002
15 years 2 months ago
2002
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...
134
Voted
CORR
2007
Springer
15 years 2 months ago
2007
Springer
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,...
84
Voted
CISS
2007
IEEE
15 years 9 months ago
2007
IEEE