The Strong Simplex Conjecture is False

IEEE Transactions on Information Theory

Volumn 40, Issue 3, 1994, Pages 721-731

  Steiner, M ^a  

^a NAVAL RESEARCH LABORATORY   (United States)

Author keywords

M ary communication; Signal design; simplex conjecture; white Gaussian noise

Indexed keywords

CHANNEL CAPACITY; COMMUNICATION CHANNELS (INFORMATION THEORY); INFORMATION THEORY; MATHEMATICAL MODELS; OPTIMIZATION; SIGNAL FILTERING AND PREDICTION; SIGNAL TO NOISE RATIO; VECTORS; WHITE NOISE;

EFFICIENT SIGNAL SETS; M-ARY COMMUNICATION; SIMPLEX CONJECTURE; WHITE GAUSSIAN NOISE;

SIGNAL PROCESSING;

EID: 0028427248     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.335884     Document Type: Article

References (23)

1. T. M. Cover and B. Gopinath, Open Problems in Communication and Computation. New York: Springer-Verlag, 1987.
2. J. L. Massey, “Towards a proof of the simplex conjecture?,” Shannon Lecture at IEEE Int. Symp. Inform. Theory, June 1988. Unpublished.
3. C. E. Shannon, “Probability of error of optimal codes in a Gaussian channel,” B.S.T. J., vol. 38, pp. 611-656, May 1959.
4. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
5. A. V. Balakrishnan, “A contribution to the sphere-packing problem of communication theory,” J. Math. Anal. Appl., vol. 3, pp. 485-506, 1961.
6. B. Dunbridge, “Asymmetric signal design for the coherent Gaussian channel,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 422-431, July 1967.
7. B. Dunbridge, Optimal signal design for the coherent Gaussian channel. Ph.D. thesis, University of Southern California, Los Angeles, December 1965.
8. H. J. Landau and D. Slepian, “On the optimality of the regular simplex code,” Bell Sys. Tech. /., vol. 45, pp. 1247-1272, Oct. 1966.
9. S. M. Farber, On the signal selection problem for phase coherent and incoherent communication channels. Ph.D. thesis, California Institute of Technology, Pasadena, 1968.
10. A. V. Balakrishnan, Advances in Communication Systems. New York: McGraw-Hill, 1965.
11. C. L. Weber, Elements of Detection and Signal Design. Berlin: Springer-Verlag, 1987.
12. M. S. Stone and C. L. Weber, “On the globally optimum M-ary noncoherent digital communications systems,” Proc. IEEE, vol. 57, pp. 1203-1204, 1969.
13. C. W. Helstrom, “The resolution of signals in white Gaussian noise,” Proc. IRE, vol. 43, pp. 1111-1118, Jan. 1955.
14. H. A. Krieger and C. A. Schaffner, “The global optimization of incoherent phase signals,” SIAM J. Appl. Math., vol. 21, pp. 573-589, Dec. 1971.
15. R. A. Horn and C. R. Johnson, Matrix Analysis. Cambridge University Press, 1985.
16. R. G. Bartle and D. R. Sherbert, Introduction to Real Analysis. New York: Wiley, 1982.
17. P. Billingsley, Probability and Measure. New York: Wiley, 1985.
18. J. F. Kenney, Mathematics of Statistics, 3rd ed. New York: D. Van Nostrand Company, 1954.
19. M. Abramowitz and I. E. Stegun, Handbook of Mathematical Functions, 9th ed. vol. AMS-55, Washington, D.C.: U.S. Government Printing Office, 1970.
20. J. L. Massey, “Coding and modulation in digital communications,” in 1974 Zurich Seminar, pp. E2 (1)-E2 (4), 1974.
21. A. J. Viterbi and J. K. Omura, Principles of Digital Communication and Coding. New York: McGraw Hill, 1979.
22. R. A. Horn, private communication.
23. M. J. Steiner, “Contributions, to statistical communication theory.” Ph.D. Dissertation, Univ. of MD., 1994.