Aji, Srinivas and Horn, Gavin and McEliece, Robert and Xu, Meina (1998) Iterative min-sum decoding of tail-biting codes. In: Information Theory Workshop, 1998 (ITW '98), Killarney, Ireland, 22-26 June 1998. IEEE , Piscataway, NJ, pp. 68-69. ISBN 0-7803-4408-1 http://resolver.caltech.edu/CaltechAUTHORS:AJIitw98
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:AJIitw98
By invoking a form of the Perron-Frobenius theorem for the “min-sum” semi-ring, we obtain a union bound on the performance of iterative decoding of tail-biting codes. This bound shows that for the Gaussian channel, iterative decoding will be optimum, at least for high SNRs, if and only if the minimum “pseudo-distance” of the code is larger than the ordinary minimum distance.
|Item Type:||Book Section|
|Additional Information:||© Copyright 1998 IEEE. Reprinted with permission This work was partially supported by NSF grant no. NCR-9505975, AFOSR grant no. 5F49620-97-1-0313, and a grant from Qualcomm, Inc. Gavin Horn’s contribution was also supported by an NSERC scholarship.|
|Subject Keywords:||AWGN channels, Hamming codes, channel coding, iterative decoding|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Archive Administrator|
|Deposited On:||23 May 2006|
|Last Modified:||26 Dec 2012 08:53|
Repository Staff Only: item control page