论文信息 - Permutation codes for the Gaussian channel

Permutation codes for the Gaussian channel

The initial vector problem is considered for group codes for the Gaussian channel and, in particular, for codes generated by permutation groups. Variant I and variant II permutation codes are defined, and optimal initial vectors for these codes are constructed. A numerical algorithm for constructing optimal group codes is presented together with examples of this algorithm applied to several permutation groups. >

John K. Karlof

[1] Ezio Biglieri,et al. Optimum permutation modulation codes and their asymptotic performance (Corresp.) , 1976, IEEE Trans. Inf. Theory.

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

[3] C. E. SHANNON,et al. A mathematical theory of communication , 1948, MOCO.

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

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

[6] D. Slepian. Bounds on communication , 1963 .

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

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

[9] Gottfried Ungerboeck,et al. Channel coding with multilevel/phase signals , 1982, IEEE Trans. Inf. Theory.

[10] A. F. Veinott,et al. On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming , 1967 .

[11] John J. Cannon. The basis of a computer system for modern algebra , 1981, SYMSAC '81.

[12] C. Sims. Computational methods in the study of permutation groups , 1970 .