TY - GEN
T1 - Computing the threshold shift for general channels
AU - Ezri, Jeremie
AU - Urbanke, Rüdiger
AU - Montanari, Andrea
AU - Oh, Sewoong
PY - 2008
Y1 - 2008
N2 - The 'threshold' of a code ensemble can be defined as the noise level at which the block error probability curve crosses 1/2. For ensembles of low-density parity check codes used over the binary erasure channel, the behavior of the threshold for large blocklengths is known in detail. It is characterized by an asymptotic threshold value, and a finite-blocklength shift parameter. Here we present a new method for computing the shift parameter that can be applied to general binary memoryless symmetric channels, and general message passing algorithms. We check that the new approach recovers the known parameters for erasure correction.
AB - The 'threshold' of a code ensemble can be defined as the noise level at which the block error probability curve crosses 1/2. For ensembles of low-density parity check codes used over the binary erasure channel, the behavior of the threshold for large blocklengths is known in detail. It is characterized by an asymptotic threshold value, and a finite-blocklength shift parameter. Here we present a new method for computing the shift parameter that can be applied to general binary memoryless symmetric channels, and general message passing algorithms. We check that the new approach recovers the known parameters for erasure correction.
UR - http://www.scopus.com/inward/record.url?scp=52349100278&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=52349100278&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2008.4595227
DO - 10.1109/ISIT.2008.4595227
M3 - Conference contribution
AN - SCOPUS:52349100278
SN - 9781424422579
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1448
EP - 1452
BT - Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008
T2 - 2008 IEEE International Symposium on Information Theory, ISIT 2008
Y2 - 6 July 2008 through 11 July 2008
ER -