• DocumentCode
    2516443
  • Title

    Linear programming bounds for unitary space time codes

  • Author

    Creignou, Jean ; Diet, Herve

  • Author_Institution
    IBM, Univ. Bordeaux I, Talence
  • fYear
    2008
  • fDate
    6-11 July 2008
  • Firstpage
    1073
  • Lastpage
    1077
  • Abstract
    The linear programming method is applied to the space Un(Copf) 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.
  • Keywords
    linear programming; matrix algebra; space-time codes; linear programming bound; space time code; unitary matrix; Context; Harmonic analysis; Helium; Linear programming; MIMO; Orbits; Polynomials; Rayleigh channels; Space time codes; Wireless communication;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2008. ISIT 2008. IEEE International Symposium on
  • Conference_Location
    Toronto, ON
  • Print_ISBN
    978-1-4244-2256-2
  • Electronic_ISBN
    978-1-4244-2257-9
  • Type

    conf

  • DOI
    10.1109/ISIT.2008.4595152
  • Filename
    4595152
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2516443