Evaluating the performance of convolutional codes over block fading channels
From MaRDI portal
Publication:4701425
DOI10.1109/18.771235zbMATH Open0957.94041OpenAlexW2107415402MaRDI QIDQ4701425FDOQ4701425
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
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
Channel models (including quantum) in information and communication theory (94A40) Convolutional codes (94B10) Error probability in coding theory (94B70)
Cited In (11)
- Analysis and performance of bidirectional decoding of convolutional codes over fading channels
- Pragmatic space-time codes for cooperative relaying in block fading channels
- Interference mitigation in cooperative SFBC-OFDM
- Performance of binary block codes at low signal-to-noise ratios
- 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
- On the performance evaluation of ISI channels
- Convolutional-block coding in channels with decision feedback
- Convolutional codes for channels with fading
- Performance evaluation of coded modulation schemes based on binary lattices
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)