Linear programming bounds for unitary space time codes
  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. 
Jean Creignou (IMB), Herv\'e Diet (IMB)