Linear programming bounds for unitary space time codes

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Information Theory

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/212097

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0803.1227
 http://arxiv.org/abs/0803.1227

Collections

arXiv