Linear programming bounds for unitary space time codes

Simple item page
dc.creatorCreignou, Jean
dc.creatorDiet, Hervé
dc.date2008-03-08
dc.date.accessioned2026-07-07T12:17:30Z
dc.date.available2026-07-07T12:17:30Z
dc.descriptionThe 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.
dc.descriptionSubmitted to ISIT 2008 4 figures
dc.identifierhttps://arxiv.org/abs/0803.1227
dc.identifierhttp://arxiv.org/abs/0803.1227
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/212097
dc.subjectInformation Theory
dc.titleLinear programming bounds for unitary space time codes
dc.typetext

Files

Collections

arXiv