This work concentrates on the study of inverse determinant sums, which arise from the union bound on the error probability, as a tool for designing and analyzing algebraic space-time block codes.
A general framework to study these sums is established, and the connection between asymptotic growth of inverse determinant sums and the diversity-multiplexing gain trade-off is investigated. It is proven that the growth of the inverse determinant sum of a division algebra-based space-time code is com...