Performance of Space–Time Codes: Gallager Bounds and Weight Enumeration

DOI10.1109/TIT.2008.926383MaRDI QIDQ3604751zbMATH OpenFDO

Authors Cong Ling, Kwok Hung Li, Alex C. Kot

Publication date 24 February 2009

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

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

zbMATH Keywords

characteristic functionellipsoidal boundGallager boundsperformance boundsspace-time codingspherical boundweight spectrum

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Bounds on codes (94B65)

Recommendations

• Performance bounds for space-time trellis codes
• On performance limits of space-time codes: a sphere-packing bound approach
• New Gallager Bounds in Block-Fading Channels
• On the Performance Analysis of Space–Time Codes in Quasi-Static Rayleigh-Fading Channels
• Distance Spectra and Performance Bounds of Space-Time Trellis Codes Over Quasi-Static Fading Channels

Cited in

(6)

• On the capacity of certain space-time coding schemes
• Distance Spectra and Performance Bounds of Space-Time Trellis Codes Over Quasi-Static Fading Channels
• On performance limits of space-time codes: a sphere-packing bound approach
• Remarks on space-time codes including a new lower bound and an improved code
• Performance bounds for space-time trellis codes
• Chernoff bounds on pairwise error probabilities of space-time codes

This page was built for publication: Performance of Space–Time Codes: Gallager Bounds and Weight Enumeration

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