Channel Coding: Theory, Algorithms, and Applications

Table 1

ML decoding complexity of $g$-group decodable STBCs.

Sphere decoder complexity	General STBC	$g$-group decodable STBC
Worst case	$\mathcal{C}$	$g\mid \mathcal{C}{\mid }^{\frac{1}{g}}$
Expected	Polynomial in $K$	Polynomial in $\frac{K}{g}$

2.1.2 Full diversity

Apart from rate and ML decoding ...