• DocumentCode
    925904
  • Title

    Optimum permutation modulation codes and their asymptotic performance (Corresp.)

  • Author

    Biglieri, Ezio M. ; Elia, Michele

  • Volume
    22
  • Issue
    6
  • fYear
    1976
  • fDate
    11/1/1976 12:00:00 AM
  • Firstpage
    751
  • Lastpage
    753
  • Abstract
    Permutation modulation codes are a class of group codes for the Gaussian channel whose codewords are obtained by permuting the components of a given initial vector X in Euclidean n -dimensional space. In this paper, the problem of choosing the components of X in such a way that the minimum distance between any two codewords is maximized is solved. In particular, a closed-form expression is obtained for this minimum distance and is used to investigate the asymptotic behavior of some selected codes.
  • Keywords
    Minimax optimization; Permutation codes; Educational institutions; Electrons; Government; Modulation coding; NIST; Performance analysis; Printing; Radar cross section; Radar detection; Signal detection;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.1976.1055629
  • Filename
    1055629
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=925904