Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum

DOI10.1109/18.817506zbMath0998.94047OpenAlexW2166990870MaRDI QIDQ4503522

Igal Sason, Shlomo Shamai

Publication date: 7 September 2000

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.817506

zbMATH Keywords

distance spectrumiterative decodingAWGN channelturbo codesmaximum-likelihood decodingbit error probabilitiesensemble performanceuniform interleaver

Mathematics Subject Classification ID

Other types of codes (94B60) Decoding (94B35) Error probability in coding theory (94B70)

Related Items (3)

The parameterized Gallager's first bounds based on conditional triplet-wise error probability ⋮ A new method for performance evaluation of bit decoding algorithms using statistics of the log likelihood ratio ⋮ Upper bound on the bit error probability of systematic binary linear codes via their weight spectra

This page was built for publication: Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum