Coding theorems for turbo code ensembles

DOI10.1109/TIT.2002.1003833MaRDI QIDQ4674518zbMATH OpenFDO

Authors Hui Jin, Robert J. McEliece

Publication date 11 May 2005

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

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

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40) Decoding (94B35)

Recommendations

• scientific article; zbMATH DE number 1498803
• scientific article; zbMATH DE number 1520609
• Coding theorems for hybrid channels
• scientific article; zbMATH DE number 3175621
• scientific article; zbMATH DE number 4193602
• Coding for Parallel Channels: Gallager Bounds and Applications to Turbo-Like Codes
• Turbo Codes in Binary Erasure Channel
• Coding theorems for the nonsynchronized channel
• Coding Theorems on the Threshold Scheme for a General Source
• Bounds on the error probability for certain ensembles of random codes

Cited in

(9)

• The geometry of turbo-decoding dynamics
• Analysis of Serial Turbo Codes over Abelian Groups for Symmetric Channels
• scientific article; zbMATH DE number 5642391 (Why is no real title available?)
• Existence and uniqueness of the solution for turbo decoding of parallel concatenated single parity check codes
• Reliable channel regions for good binary codes transmitted over parallel channels
• \(1/n\) turbo codes from linear system point of view
• Turbo Codes in Binary Erasure Channel
• Performance of Parallel Concatenated Coding Schemes
• On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes

This page was built for publication: Coding theorems for turbo code ensembles

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