Abstract:
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. Thi...Show MoreMetadata
Abstract:
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.
Published in: 1998 Information Theory Workshop (Cat. No.98EX131)
Date of Conference: 22-26 June 1998
Date Added to IEEE Xplore: 06 August 2002
Print ISBN:0-7803-4408-1
Related Articles are not available for this document.
