Turbo Codes in Binary Erasure Channel

DOI10.1109/TIT.2008.917723zbMATH Open1328.94089OpenAlexW2122461304MaRDI QIDQ3604435FDOQ3604435

Jeong-Woo Lee, Ruediger Urbanke, Richard E. Blahut

Publication date: 24 February 2009

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

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

Recommendations

• Iterative decoding of binary block and convolutional codes
• An analysis of the block error probability performance of iterative decoding
• Coding theorems for turbo code ensembles
• Stopping Set Distribution of LDPC Code Ensembles
• Convergence and errors in turbo-decoding

Mathematics Subject Classification ID

Other types of codes (94B60) Combined modulation schemes (including trellis codes) in coding theory (94B12)

Cited In (8)

• Two simple stopping criteria for turbo decoding
• Coding theorems for turbo code ensembles
• Decoding of turbo codes in symmetric alpha-stable noise
• Title not available (Why is that?)
• Trellis-coded quantization for binary erasure channels
• Title not available (Why is that?)
• \(1/n\) turbo codes from linear system point of view
• Cryptography and Coding

This page was built for publication: Turbo Codes in Binary Erasure Channel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604435)