Linear programming bounds for unitary space time codes
arXiv:0803.1227
Abstract
The linear programming method is applied to the space $\U_n(\C)$ of unitary matrices in order to obtain bounds for codes relative to the diversity sum and the diversity product. Theoretical and numerical results improving previously known bounds are derived.
Submitted to ISIT 2008 4 figures