Linear programming bounds for unitary space time codes

The linear programming method is applied to the space Un(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.

• Type: Journal
• Year: 2008
• Where: CORR
• Authors: Jean Creignou, Hervé Diet
• Keywords: CORR 2008, Diversity Sum, Education, Linear Programming Method, Unitary Matrices