39 search results - page 3 / 8 » Error exponents of expander codes |
CORR
2004
Springer
13 years 5 months ago
2004
Springer
We address the problem of bounding below the probability of error under maximum-likelihood decoding of a binary code with a known distance distribution used on a binarysymmetric ch...
TIT
2010
13 years 21 days ago
2010
Typical minimum distances and error exponents are analyzed on the 8-PSK Gaussian channel for two capacityachieving code ensembles with different algebraic structure. It is proved t...
CORR
2007
Springer
13 years 6 months ago
2007
Springer
The analysis of random coding error exponents pertaining to erasure/list decoding, due to Forney, is revisited. Instead of using Jensen’s inequality as well as some other inequa...
CORR
2007
Springer
13 years 6 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
2007
Springer
13 years 6 months ago
2007
Springer
Universally achievable error exponents pertaining to certain families of channels (most notably, discrete memoryless channels (DMC’s)), and various ensembles of random codes, ar...