On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes

DOI10.1109/18.945248MaRDI QIDQ4544670zbMATH OpenOpenAlexFDO

Authors Igal Sason, S. Shamai

Publication date 4 August 2002

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

Full work available at URL https://arxiv.org/abs/cs/0512074

zbMATH Keywords

block codesboundsdecoding error probabilitydistance spectrumfading channelsinput-output weight distributionmaximum likelihood decodingthresholdsturbo-like codes

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Decoding (94B35) Other types of codes (94B60)

Abstract: Upper and lower bounds on the error probability of linear codes under maximum-likelihood (ML) decoding are shortly surveyed and applied to ensembles of codes on graphs. For upper bounds, focus is put on Gallager bounding techniques and their relation to a variety of other reported bounds. Within the class of lower bounds, we address de Caen's based bounds and their improvements, sphere-packing bounds, and information-theoretic bounds on the bit error probability of codes defined on graphs. A comprehensive overview is provided in a monograph by the authors which is currently in preparation.

Recommendations

• Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum
• New performance bounds for turbo codes
• Coding theorems for turbo code ensembles
• Variations on the Gallager bounds, connections, and applications
• Coding for Parallel Channels: Gallager Bounds and Applications to Turbo-Like Codes

Cited in

(11)

• New performance bounds for turbo codes
• New Gallager Bounds in Block-Fading Channels
• Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes
• Coding for Parallel Channels: Gallager Bounds and Applications to Turbo-Like Codes
• scientific article; zbMATH DE number 1182521 (Why is no real title available?)
• Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum
• Variance of the turbo code performance bound over the interleavers
• Variations on the Gallager bounds, connections, and applications
• Coded diversity on block-fading channels
• Evaluating the performance of convolutional codes over block fading channels
• Variations on the Gallager bounds with some applications

This page was built for publication: On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes

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