New Gallager Bounds in Block-Fading Channels
From MaRDI portal
Publication:3548063
DOI10.1109/TIT.2006.888999zbMATH Open1310.94236OpenAlexW2111987294MaRDI QIDQ3548063FDOQ3548063
Authors: Xiaofu Wu, Haige Xiang, Cong Ling
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2006.888999
Recommendations
- Variations on the Gallager bounds, connections, and applications
- Gallager Bounds for Noncoherent Decoders in Fading Channels
- On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes
- New performance bounds for turbo codes
- Coded diversity on block-fading channels
Coding theorems (Shannon theory) (94A24) Bounds on codes (94B65) Channel models (including quantum) in information and communication theory (94A40)
Cited In (5)
- Variations on the Gallager bounds with some applications
- Performance of Space–Time Codes: Gallager Bounds and Weight Enumeration
- Gallager Bounds for Noncoherent Decoders in Fading Channels
- A Tight Lower Bound to the Outage Probability of Discrete-Input Block-Fading Channels
- Variations on the Gallager bounds, connections, and applications
This page was built for publication: New Gallager Bounds in Block-Fading Channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548063)