Extrinsic information transfer functions: model and erasure channel properties

By Alexei E. Ashikhmin, Gerhard Kramer, Stephan ten Brink. IEEE Transactions on Information Theory, 2004

770 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A close-to-capacity dirty paper coding scheme (2004, background): “With the chain–rule of mutual information [32], [33], [34], [35] we can compute the mutual information of an equivalent bit channel, i.”
Generalized approximate message passing for estimation with random linear mixing (2010, methodology): “alar equivalent model. The parameters in this model can be computed by a set of scalar state evolution (SE) equations, analogous to the density evolution equations for BP decoding of LDPC codes [15], [16]. From this scalar equivalent model, one can asymptotically exactly predict any componentwise pe”
Bit-Interleaved Coded Modulation (2008, background): “Furthermore, this result suggests that any area gap between the two EXIT curves translates in a rate loss with respect to the capacity Ccm X [6].”
Spatially coupled ensembles universally achieve capacity under belief propagation (2012, background): “Since all the distributions of interest are symmetric, it sufﬁces to look at the | D | -domain instead of the D -domain. however, we To ease our notation, will formally write expressions like d ( a , b ) , i.e., we will allow the arguments to be e.g.”