63 search results - page 2 / 13 » Error Exponents of Optimum Decoding for the Interference Cha... |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Guruswami and Indyk showed in [1] that Forney's error exponent can be achieved with linear coding complexity over binary symmetric channels. This paper extends this conclusion...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
Motivated by applications of rateless coding, decision feedback, and automatic repeat request (ARQ), we study the problem of universal decoding for unknown channels in the presence...
TCOM
2010
13 years 1 days ago
2010
It has been widely acknowledged that the aggregate interference at the receiver for various practical communication channels can often deviate markedly from the classical additive ...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
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 ...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Recent works showed how low-density parity-check (LDPC) erasure correcting codes, under maximum likelihood (ML) decoding, are capable of tightly approaching the performance of an i...