论文信息 - Optimal permutation codes for the Gaussian channel

Optimal permutation codes for the Gaussian channel

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.

John K. Karlof | Yaw O. Chang

[1] D. Slepian. Permutation Modulation , 1965, Encyclopedia of Wireless Networks.

[2] John K. Karlof. Permutation codes for the Gaussian channel , 1989, IEEE Trans. Inf. Theory.

[3] D. Slepian. Group codes for the Gaussian channel , 1968 .

[4] David S. Slepian,et al. Group codes for the Gaussian channel (Abstr.) , 1968, IEEE Trans. Inf. Theory.

[5] R. Dembo,et al. Solution of Generalized Geometric Programs , 1975 .

[6] Scott A. Burns,et al. Generalized geometric programming with many equality constraints , 1987 .

[7] John K. Karlof,et al. Large scale geometric programming: An application in coding theory , 1994, Comput. Oper. Res..

[8] J. F. Blake,et al. Distance Properties of Group Codes for the Gaussian Channel , 1972 .

[9] I. F. Blake,et al. An optimization problem for unitary and orthogonal representations of finite groups , 1972 .