76 search results - page 1 / 16 » Random codes: Minimum distances and error exponents |
TIT
2002
13 years 4 months ago
2002
Abstract--Minimum distances, distance distributions, and error exponents on a binary-symmetric channel (BSC) are given for typical codes from Shannon's random code ensemble an...
CORR
2004
Springer
13 years 4 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...
CORR
2007
Springer
13 years 4 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 4 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
2008
Springer
13 years 4 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...