Robust space-time codes for time-selective fading

We consider the design of robust codes that exploit both space and time diversity, using bit-interleaved coded modulation. Under quasi-static fading conditions, codes constructed in this way achieve full diversity and perform close to the best space-time trellis codes of comparable complexity. Under fast-fading conditions, these same codes achieve higher diversity than previously known codes of the same complexity.