• DocumentCode
    818419
  • Title

    Decoding spherical codes for the Gaussian channel

  • Author

    Karlof, John K.

  • Author_Institution
    Dept. of Math. Sci., North Carolina Univ., Wilmington, NC, USA
  • Volume
    39
  • Issue
    1
  • fYear
    1993
  • fDate
    1/1/1993 12:00:00 AM
  • Firstpage
    60
  • Lastpage
    65
  • Abstract
    A decoding algorithm for permutation codes that is equivalent to maximum-likelihood decoding, but less complex than the correlation decoder, is presented. A general construction for iteratively maximum-likelihood decodable (IMLD) codes is proved and used to construct IMLD codes for every dimension n. D. Slepian (1965) defined permutation modulation codes and presented an efficient algorithm for their decoding. Slepian´s decoding scheme is one of the principal components of the permutation code decoding algorithm presented
  • Keywords
    decoding; telecommunication channels; Gaussian channel; IMLD codes; decoding algorithm; iteratively maximum-likelihood decodable codes; permutation codes; spherical codes; Error probability; Gaussian channels; Iterative algorithms; Iterative decoding; Maximum likelihood decoding; Modulation coding; NP-hard problem;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.179342
  • Filename
    179342
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=818419