39 search results - page 6 / 8 » Error exponents of expander codes |
CORR
2006
Springer
13 years 7 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...
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract—We initiate the probabilistic analysis of linear programming (LP) decoding of low-density parity-check (LDPC) codes. Specifically, we show that for a random LDPC code e...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
—In this paper, we employ time-reversal space-time block coding (TR-STBC) in single-carrier direct sequence codedivision multiple access (DS-CDMA) block transmission in the prese...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...