Worstcase Power-Constrained Noise for Binary-Input Channels

IEEE Transactions on Information Theory

Volumn 38, Issue 5, 1992, Pages 1494-1511

  Verdu, Sergio ^b  

^a Shitz), Shlomo   (Israel)

^b PRINCETON UNIVERSITY   (United States)

Author keywords

channel capacity; discrete input channels; probability of error; worstcase noise

Indexed keywords

INFORMATION THEORY - CHANNEL CAPACITY; NOISE, SPURIOUS SIGNAL - SIGNAL TO NOISE RATIO; OPTIMIZATION; PROBABILITY - RANDOM PROCESSES;

DISCRETE-INPUT CHANNELS; ERROR PROBABILITY; WORST-CASE NOISE DISTRIBUTION;

INFORMATION THEORY;

EID: 0026913942     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.149501     Document Type: Article

References (35)

1. N. M. Blachman, “Communication as a Game,” IRE Wescon Rec., vol. 2, pp. 61–66, 1957.
2. R. E. Blahut, Principles and Practice of Information Theory. Reading, MA: Addison-Wesley, 1987.
3. J. M. Borden, D. M. Mason, and R. J. McEliece, “Some information theoretic saddlepoints,” Siam J. Contr. Opimiz., vol. 23, pp. 129–143, Jan. 1985.
4. J. A. Bucklew, Large Deviation Techniques in Decision, Simulation and Estimation. New York: Wiley Interscience, 1990.
5. C. R. Cahn, “Worst interference for coherent binary channel,” IEEE Trans. Inform. Theory, vol. 17, pp. 209–210, Mar. 1971.
6. L. Le Cam, Asymptotic Methods in Statistical Decision Theory. New York: Springer, 1986.
7. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups. New York: Springer Verlag, 1988.
8. I. Csiszar and J. Korner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
9. I. Csiszar and P. Narayan, “Capacity and decoding rules of arbitrarily varying channels,” IEEE Trans. Inform. Theory, vol. 35, pp. 752–764, July 1989.
10. R. L. Dobrushin, “Optimum information transmission through a channel with unknown parameters,” Radiotech Electron., vol. 4, pp. 1951–1956, 1959.
11. T. Ericson, “The arbitrary varying channel and the jamming problem,” Acta Electron Sinica, vol. 14, no. 4, pp. 21–35, July 1986.
12. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
13. F. E. Glave, “An upper bound on the probability of error due to intersymbol interference for correlated digital signals,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 356–363, May 1972.
14. E. Hansler, “An upper bound of error probability in data transmission systems,” Nachrichtentech. Z., vol. 12, pp. 625–627, 1970.
15. M. V. Hedge, W. E. Stark, and D. Teneketzis, “On the capacity of channels with unknown interference,” IEEE Trans. Inform. Theory, vol. 35, pp. 770–783, July 1989.
16. B. Hughes and P. Narayan, “Interleaving and channels with unknown memory,” in Proc. 19th Conf. Inform. Sci. Syst., Johns Hopkins Univ., Baltimore, MD, Mar. 1985, pp. 722–725.
17. “Gaussian arbitrarily varying channels,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 267–284, Mar. 1987.
18. M. Loeve, Probability Theory. New York: Springer, 1977.
19. D. G. Luenberger, Optimization by Vector Space Methods. New York: Wiley, 1969.
20. R. J. McEliece, The Theory of Information and Coding: A Mathematical Framework for Communication. Reading, MA: Addison-Wesley, 1977.
21. R. J. McEliece and W. E. Stark, “An information-theoretic study of communication in the presence of jamming,” Proc. IEEE Int. Conf. Commun., 1981, pp. 45.3.1–45.3.5.
22. R. J. McEliece, “Communication in the presence of jamming—An information theoretic approach,” in Secure Digital Communications, G. Lungo, Ed. New York: Springer-Verlag, 1983, pp. 127–166.
23. R. J. McEliece and W. E. Stark, “Channels with block interference,” IEEE Trans. Inform. Theory, vol. IT-30, pp. 44–54, Jan. 1984.
24. J. L. Morris, “On single-sample robust detection of known signals with additive unknown-mean amplitude-bounded random interference,” IEEE Trans. Inform. Theory, vol. IT-26, pp. 199–205, Mar. 1980.
25. “On single-sample robust detection of known signals with additive unknown-mean amplitude-bounded random interference. Part II: The randomized decision rule solution,” IEEE Trans. Inform. Theory, vol. IT-27, pp. 132–136, Jan. 1981.
26. J. L. Morris and N. E. Dennis, “A random-threshold decision rule for known signals with additive amplitude-bounded nonstationary random interference,” IEEE Trans. Commun., vol. 38, pp. 160–164, Feb. 1990.
27. R. T. Rockafellar, Convex Analysis. Princeton, NJ: Princeton Univ. Press, 1970.
28. W. L. Root, “Communications through unspecified additive noise,” Inform. Contr., vol. 4, pp. 15–29, 1961.
29. W. E. Stark, D. Teneketzis, and S. K. Park, “worstcase analysis of partial-band interference,” in Proc. 1986 Conf. Inform. Sci. Syst., Princeton Univ., Princeton, NJ, 1986, pp. 379–383.
30. W. E. Stark and R. J. McEliece, “On the capacity of channels with block memory,” IEEE Trans. Inform. Theory, vol. 34, pp. 322–324, Mar. 1988.
31. I. G. Stiglitz, “Coding for a class of unknown channels,” IEEE Trans. Inform. Theory, vol. 12, pp. 289–195, Apr. 1966.
32. S. Verdu and H. V. Poor, “Minimax robust discrete-time matched filters,” IEEE Trans. Commun., vol. COM-31, pp. 208–215, Feb. 1983.
33. J. Wolfowitz, Coding Theorems of Information Theory, third ed. New York: Springer, 1978.
34. L. H. Zetterberg, “Signal detection under noise interference in a game situation,” IRE Trans. Inform. Theory, vol. IT-8, pp. 47–52, Sept. 1962.
35. Y. I. Zhodzishskiy, “Maximum guaranteed noise immunity of bit-by-bit reception with limiting on interference mean power,” Radiotekhnika, no. 10, pp. 56–57, 1986.