G. D. Forney, Jr., F. R. Kschischang, and A. Reznik, "The effective weight of pseudocodewords for codes defined on graphs with cycles on AWGN channels," Preprint.  Home/Search   Document Details and Download   Summary   Related Articles

....we show that iterative min sum decoding of a tail biting code will be effective if and only if the minimum pseudoweight of the code is strictly greater than its ordinary minimum weight. Closely related results were discovered independently by Wiberg in his thesis [15] and by Forney et al., in [10]. This paper is an extension of [2] Besides containing some new results on pseudoweights, this paper also includes results for the BSC as well. 2 Perron Frobenius Theorem for the min sum semiring In this section we will state without proof a Perron Frobenius theorem for the min sum semiring, ....

G. D. Forney, Jr., F. R. Kschischang, and A. Reznik, "The effective weight of pseudocodewords for codes defined on graphs with cycles on AWGN channels," Preprint.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC