Optimal permutation codes for the Gaussian channel

  • Authors:
  • J. K. Karlof;Y. O. Chang

  • Affiliations:
  • Dept. of Math. Sci., North Carolina Univ., Wilmington, NC;-

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

Quantified Score

Hi-index 754.84

Visualization

Abstract

This correspondence contains a continuation of the table contained in Karlof (1989) listing the minimum distance of optimal permutation codes generated by primitive permutation groups of degree less than or equal to 20. We use a nonlinear programming algorithm developed using geometric programming techniques