Decoding Spherical Codes Generated by Binary Partitions of Symmetric Pointsets
暂无分享,去创建一个
[1] John K. Karlof,et al. On the existence of [M, n] group codes for the Gaussian channel with [M, n] odd , 1977, IEEE Trans. Inf. Theory.
[2] John K. Karlof. Permutation codes for the Gaussian channel , 1989, IEEE Trans. Inf. Theory.
[3] I. Blake,et al. Group Codes for the Gaussian Channel , 1975 .
[4] Fred S. Roberts,et al. Applied Combinatorics , 1984 .
[5] G. David Forney,et al. Generalized minimum distance decoding , 1966, IEEE Trans. Inf. Theory.
[6] Ezio Biglieri,et al. Optimum permutation modulation codes and their asymptotic performance (Corresp.) , 1976, IEEE Trans. Inf. Theory.
[7] Victor Zinoviev,et al. Spherical codes generated by binary partitions of symmetric pointsets , 1995, IEEE Trans. Inf. Theory.
[8] Ezio Biglieri,et al. On the existence of group codes for the Gaussian channel , 1972, IEEE Trans. Inf. Theory.
[9] D. Slepian. Permutation Modulation , 1965, Encyclopedia of Wireless Networks.
[10] J. F. Blake,et al. Distance Properties of Group Codes for the Gaussian Channel , 1972 .
[11] John K. Karlof,et al. Optimal [M, 3] group codes for the Gaussian channel (Corresp.) , 1978, IEEE Trans. Inf. Theory.
[12] W. Fischer,et al. Sphere Packings, Lattices and Groups , 1990 .