39 search results - page 1 / 8 » Error exponents of expander codes |
TIT
2002
13 years 4 months ago
2002
CORR
2006
Springer
13 years 4 months ago
2006
Springer
-- We introduce a thermodynamic (large deviation) formalism for computing error exponents in error-correcting codes. Within this framework, we apply the heuristic cavity method fro...
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
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...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
A unified framework to obtain all known lower bounds (random coding, typical random coding and expurgated bound) on the reliability function of a point-to-point discrete memoryles...