A note on permutation modulation

  • Authors:

  • W. W. Peterson

  • Affiliations:

  • Dept. of Inf. & Comput. Sci., Hawaii Univ., Honolulu, HI

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2006

Quantified Score

Hi-index 754.84

Visualization

Abstract

Slepian (1962) observed that the code points in an n-dimensional variant-1 permutation modulation code actually lie in an n-1-dimensional subspace. In this correspondence, a change of coordinates which gives the representation explicitly in n-1 dimensions is derived. Slepian's optimum decoding algorithm can be adapted to the codes in this form using an idea of Biglieri and Elia (1976)