Evaluating the performance of convolutional codes over block fading channels

DOI10.1109/18.771235MaRDI QIDQ4701425zbMATH OpenOpenAlexFDO

Authors Esa Malkamäki, Harry Leib

Publication date 21 November 1999

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

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

zbMATH Keywords

upper bounderror control codesblock fading Rician channelslimited interleaving

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Convolutional codes (94B10) Error probability in coding theory (94B70)

Recommendations

• Further Results on Convolutional Code Search for Block-Fading Channels
• Convolutional codes for channels with fading
• New Gallager Bounds in Block-Fading Channels
• On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes
• On coding for block fading channels

Cited in

(11)

• Analysis and performance of bidirectional decoding of convolutional codes over fading channels
• Convolutional-block coding in channels with decision feedback
• On the performance evaluation of ISI channels
• Interference mitigation in cooperative SFBC-OFDM
• The performance of convolutional codes on the block erasure channel using various finite interleaving techniques
• On coding for block fading channels
• Further Results on Convolutional Code Search for Block-Fading Channels
• Performance evaluation of coded modulation schemes based on binary lattices
• Pragmatic space-time codes for cooperative relaying in block fading channels
• Performance of binary block codes at low signal-to-noise ratios
• Convolutional codes for channels with fading

This page was built for publication: Evaluating the performance of convolutional codes over block fading channels

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