Reliability criteria in information theory and in statistical hypothesis testing

Foundations and Trends in Communications and Information Theory

Volumn 4, Issue 2-3, 2007, Pages 97-263

  Haroutunian, Evgueni A ^a   Haroutunian, Mariam E ^a   Harutyunyan, Ashot N ^b  

^a INSTITUTE FOR INFORMATICS AND AUTOMATION PROBLEMS   (Armenia)

^b UNIVERSITY OF DUISBURG ESSEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CELLULAR RADIO SYSTEMS; CYBERNETICS; ELECTRIC POWER TRANSMISSION; INFORMATION THEORY; PROBABILITY; PROGRAMMING THEORY; RELIABILITY; RELIABILITY THEORY; STATISTICAL METHODS; STATISTICS; SURVEYS; TESTING; TRANSMISSIONS;

(E ,2E) THEORY; CENTRAL PROBLEMS; CODING RATES; ERROR PROBABILITIES; FINITE ALPHABETS; INFORMATION TRANSMISSION SYSTEMS; MEMORY LESS SYSTEMS; READERS (USER EXPERIENCE); RELIABILITY CRITERION; RELIABLE TRANSMISSION; SHANNON-THEORY; STATISTICAL HYPOTHESIS TESTING;

QUALITY ASSURANCE;

EID: 45849153097     PISSN: 15672190     EISSN: 15672328     Source Type: Journal    
DOI: 10.1561/0100000008     Document Type: Review

References (230)

1. R. F. Ahlswede, "On two-way communication channels and a problem by Zarankiewicz," in Transactions on 6th Prague. Conference, on Information Theory, Statistical Decision Function, Random Proceedings, pp. 23-37, Prague, 1971.
2. R. F. Ahlswede, "Multy-way communication channels," in 2nd International Symposium on Information Theory, Tsahkadzor, Armenia, 1971, pp. 23-52, Budapest: Akad. Kiado, 1973.
3. R. F. Ahlswede, "The capacity region of a channel with two senders and two receivers," Annals of Probability, vol. 2, no. 2, pp. 805-814, 1974.
4. R. F. Ahlswede, "Elimination of correlation in random codes for arbitrarily varying channels," Z. Wahrscheinlichkeitstheorie Verw. Gebiete, vol. 44, pp. 186-194, 1978.
5. R. F. Ahlswede, "Coloring hypergraphs: A new approach to multi-user source coding," Part I, Journal of Combinatories, Information and System Sciences, vol. 4, no. 1, pp. 75-115, 1979.
6. R. F. Ahlswede, "Coloring hypergraphs: A new approach to multi-user source coding," Part II, Journal of Combinatories, Information and System Sciences, vol. 5, no. 2, pp. 220-268, 1980.
7. R. F. Ahlswede, "The rate-distortion region for multiple descriptions without excess rate," IEEE Transactions on Information Theory, vol. 31, no. 6, pp. 721-726, 1985.
8. R. F. Ahlswede, "Arbitrarily varying channels with states sequence known to the sender," IEEE Transations on Information Theory, vol. 32, no. 5, pp. 621-629, 1986.
9. R. F. Ahlswede, "Extremal properties of rate-distortion functions," IEEE lYansactions on Information Theory, vol. 36, no. 1, pp. 166-171, 1990.
10. R. F. Ahlswede, "General theory of information transfer," Preprint 97-118, Discrete Strukturen in der Mathematik, Universität Bielefeld, 1997.
11. R. F. Ahlswede, E. Aloyan, and E. A. Haroutunian, "On logarithmically asymptotically optimal hypothesis testing for arbitrarily varying source with side information," in Lecture Notes in Computer Science, Vol. 4123, General Theory of Information Transfer and Combinatorics, pp. 457-461, Springer Verlag, 2006.
12. R. F. Ahlswede and M. Burnashev, "On minimax estimation in the presence of side information about remote data," Annals of Statistics, vol. 18, no. 1, pp. 141-171, 1990.
13. R. F. Ahlswede and N. Cai, "Arbitrarily varying multiple access channels," Part 1, Preprint 96-068, Discrete Strukturen in der Mathematik, Universität Bielefeld, 1996.
14. R. F. Ahlswede and N. Cai, "Arbitrarily varying multiple access channels," Part 2, Preprint 97-006, Discrete Strukturen in der Mathematik, Universität Bielefeld, 1997.
15. R. F. Ahlswede and N. Cai, "Correlated sources help transmission over an arbitrarily varying channel," IEEE Transactions on Information Theory, vol. 43, pp. 1254-1255, 1997.
16. R. F. Ahlswede and I. Csiszár, "Hypothesis testing with communication constraints," IEEE Transactions on Information Theory, vol. 32, pp. 533-542, 1986.
17. R. F. Ahlswede and G. Dueck, "Identification via channels," IEEE Transactions on Information Theory, vol. 35, no. 1, pp. 15-29, 1989.
18. R. F. Ahlswede and E. A. Haroutunian, "On statistical hypothesis optimal testing and identification," Transactions of the Institute for Informatics and Automation Problems NAS of RA, Mathematical Problems of Computer Science, vol. 24, pp. 16-33, 2005.
19. R. F. Ahlswede and E. A. Haroutunian, "On logarithmically asymptotically optimal testing of hypotheses and identification," in Lecture Notes in Computer Science. Vol. 4123, General Theory of Information Transfer and Combinatorics, pp. 462-478, Springer Verlag, 2006.
20. R. F. Ahlswede and J. Körner, "Source coding with side information and a converse for degraded broadcast channels," IEEE Transactions on Information Theory, vol. 21, pp. 629-637, November 1975.
21. R. F. Ahlswede and I. Wegener, Search Problems. New York: J. Wiley-Interscience, 1987. (German original, Teubner, Sfuttgart, 1979, Russian translation, Mir, Moscow 1982).
22. R. F. Ahlswede, E. Yang, and Z. Zhang, "Identification via compressed data," IEEE Transactions on Information Theory, vol. 43, no. 1, pp. 48-70, 1997.
23. V. Anantharam, "A large deviations approach to error exponent in source coding and hypothesis testing," IEEE Transactions on Information Theory, vol. 36, no. 4, pp. 938-943, 1990.
24. R. E. Bechhofer, J. Kiefer, and M. Sobel, Sequential Identification and Ranking Procedures. Chicago: The University of Chicago Press, 1968.
25. R. Benzei, "The capacity region of a class of discrete additive degraded interference channels," IEEE Transactions on Information Theory, vol. 25, no. 2, pp. 228-231, 1979.
26. T. Berger, Rate Distortion Theory: A Mathematical Basis for Data Compression. Englewood Cliffs, NJ: Prentice-Hall, 1971.
27. T. Berger, "The source coding game," IEEE Transaactions on Information Theory, vol. 17, no. 1, pp. 71-76, 1971.
28. T. Berger, "Decentralized estimation and decision theory," in Presented at IEEE Seven Springs Workshop on Information Theory, Mt. Kisco, NY, September 1979.
29. T. Berger and Z. Zhang, "New results in binary multiple descriptions," IEEE Transactions on Information Theory, vol. 33, no. 4, pp. 502-521, 1987.
30. T. Berger and Z. Zhang, "Multiple description source coding with no excess marginal rate," IEEE Transactions on Information Theory, vol. 41, no. 2, pp. 349-357, 1995.
31. P. P. Bergmans, "Random coding theorem for broadcast channels with degraded components," IEEE lYansactions on Information Theory, vol. 9, pp. 197-207, 1973.
32. L. Birgé, "Vitesse maximales de décroissance des erreurs et tests optimaux associés," Z. Wahrscheinlichkeitstheorie Verw. Gebiete, vol. 55, pp. 261-273, 1981.
33. D. Blackwell, L. Breiman, and A. J. Thomasian, "The capacity of a class of channels," Annals of Mathematical Statistics, vol. 30, no. 4, pp. 1229-1241, 1959.
34. R. E. Blahut, "Hypothesis testing and information theory," IEEE Transactions on Information Theory, vol. 20, pp. 405-417, 1974.
35. R. E. Blahut, Principles and Practice of Information Theory. Reading, MA: Addison-Wesley, 1987.
36. A. A. Borovkov, Mathematical Statistics, (in Russian), Nauka, Novosibirsk, 1997.
37. M. V. Burnashev, S. Amari, and T. S. Han, "BSC: Testing of hypothesis with information constraints," in Numbers, Information and Complexity, (Althófer, ed.), Boston: Kluwer Academic Publishers, 2000.
38. C. Cachin, "An information-theoretic model for steganography," in Proceedings of 2nd Workshop on Information Hiding, (D. Ausmith, ed.), in Lecture Notes in Computer Science, Springer Verlag, 1998.
39. A. B. Carleial, "A case where interference does not reduce capacity," IEEE Transactions on Information Theory, vol. 21, pp. 569-570, 1975.
40. A. B. Carleial, "Interference channels," IEEE Transactions on Information Theory, vol. 24, no. 1, pp. 60-70, 1978.
41. A. B. Carleial, "Outer bounds on the capacity of interference channels," IEEE Transactions on Information Theory, vol. 29, no. 4, pp. 602-604, 1983.
42. P.-N. Chen, "General formula for the Neyman-Pearson type-11 error exponent subject to fixed and exponential type-1 error bounds," IEEE Transactions on Information Theory, vol. 42, no. 1, pp. 316-323, 1996.
43. P.-N. Chen and F. Alajaji, Lecture Notes in Information Theory, vol. I and II, http://shannon.cm.nctu.edu.tw.
44. M. H. M. Costa and A. El Gamal, "The capacity region of the discrete memoryless interference channel with strong interference," IEEE Transactions on Information Theory, vol. 33, pp. 710-711, 1987.
45. T. M. Cover, "Broadcast channels," IEEE Transactions on Information Theory, vol. 18, no. 1, pp. 2-14, 1972.
46. T. M. Cover, "An achievable rate region for the broadcast channel," IEEE Transactions on Information Theory, vol. 21, pp. 399-404, 1975.
47. T. M. Cover, "Comments on broadcast channels," IEEE Transactions on Information Theory, vol. 44, pp. 2524-2530, 1998.
48. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
49. I. Csiszár, "The method of types," IEEE Transactions on Information Theory, vol. 44, no. 6, pp. 2505-2523, 1998.
50. I. Csiszár and J. Körner, "Graph decomposition: A new key to coding theorems," IEEE Transactions on Information Theory, vol. 27, no. 1, pp. 5-12, 1981.
51. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic Press, 1981. (Russian translation, Mir, Moscow, 1985).
52. I. Csiszár, J. Körner, and K. Marton, "A new look at the error exponent of a discrete memoryless channel," in Presented at the IEEE International Symposium on Information Theory, Ithaca, NY: Cornell Univ., 1977. (Preprint).
53. I. Csiszár and G. Longo, "On the error exponent for source coding and for testing simple statistical hypotheses," Studia Scientiarum Mathematicarum Hungarica, vol. 6, pp. 181-191, 1971.
54. I. Csiszár and P. Shields, "Information theory and statistics: A tutorial," in Foundation and Trends in Communications and Information theory, note-Hanover, MA, USA: now Publishers, 2004.
55. A. Das and P. Narayan, "Capacities of time-varying multiple-access channels with side information," IEEE Transactions on Information Theory, vol. 48, no. 1, pp. 4-25, 2002.
56. R. L. Dobrushin, "Optimal information transmission in a channel with unknown parameters," (in Russian), Radiotekhnika Electronika, vol. 4, pp. 1951-1956, 1959.
57. R. L. Dobrushin, "Asymptotic bounds of the probability of error for the transmission of messages over a memoryless channel with a symmetric transition probability matrix," (in Russian), Teorija Veroyatnost. i Primenen, vol. 7, no. 3, pp. 283-311, 1962.
58. R. L. Dobrushin, "Survey of Soviet research in information theory," IEEE Transactions on Information Theory, vol. 18, pp. 703-724, 1972.
59. R. L. Dobrushin, M. S. Pinsker, and A. N. Shiryaev, "Application of the notion of entropy in the problems of detecting a signal in noise," (in Russian). Lithuanian Mathematical Transactions, vol. 3, no. 1, pp. 107-122, 1963.
60. J. L. Doob, Stochastic Processes. New York: Wiley, London: Chapman and Hall, 1953.
61. G. Dueck, "Maximal error capacity regions are smaller than average error capacity regions for multi-user channels," Problems of Control and Information Theory, vol. 7, no. 1, pp. 11-19, 1978.
62. G. Dueck, "The capacity region of two-way channel can exceed the inner bound," Information and Control, vol. 40, no. 3, pp. 258-266, 1979.
63. G. Dueck and J. Körner, "Reliability function of a discrete memoryless channel at rates above capacity," IEEE Transactions on Information Theory, vol. 25, no. 1, pp. 82-85, 1979.
64. A. G. Dyachkov, "Random constant composition codes for multiple access channels," Problems of Control and Information on Theory, vol. 13, no. 6, pp. 357-369, 1984.
65. A. G. Dyachkov, "Lower bound to average by ensemble error probability for multiple access channel," (in Russian). Problems of Information on Transmission, vol. 22, no. 1, pp. 98-103, 1986.
66. A. El Gamal and M. N. Costa, "The capacity region of a class of deterministic interference channel," IEEE Transactions on Information Theory, vol. 28, no. 2, pp. 343-346, 1982.
67. A. El Gamal and T. M. Cover, "Achievable rates for multiple descriptions," IEEE Transactions on Information Theory, vol. 28, no. 6, pp. 851-857, 1982.
68. A. El Gamal and E. Van der Meulen, "A proof of Marton's coding theorem for the discrete memoryless broadcast channel," IEEE Transactions on Information Theory, vol. 27, pp. 120-122, 1981.
69. P. Elias, "Coding for noisy channels," IRE Convention Record. Part 4, pp. 37-46, 1955.
70. W. H. R. Equitz and T. M. Cover, "Successive refinement of information," IEEE Transactions on Information Theory, vol. 37, no. 2, pp. 269-275, 1991.
71. T. Ericson, "Exponential error bounds for random codes in the arbitrarily varying channels," IEEE Transactions on Information Theory, vol. 31, no. 1, pp. 42-48, 1985.
72. R. M. Fano, Transmission of Information. A Statistical Theory of Communication. New York, London: Wiley, 1961.
73. M. Feder and N. Merhav, "Universal composite hypothesis testing: A competitive minimax approach," IEEE Transactions on Information Theory, vol. 48, no. 6, pp. 1504-1517, 2002.
74. A. Feinstein, "A new basic theorem of information theory," IRE Transactions on Information Theory, vol. 4, pp. 2-22, 1954.
75. A. Feinstein, Foundations of Information Theory. New York: McGraw-Hill, 1958.
76. G. D. Forney, "Exponential error bounds for erasure, list and decision feedback schemes," IEEE Transactions on Information Theory, vol. 14, no. 2, pp. 206-220, 1968.
77. F. W. Fu and S. Y. Shen, "Hypothesis testing for arbitrarily varying source with exponential-type constraint," IEEE Transactions on Information Theory, vol. 44, no. 2, pp. 892-895, 1998.
78. R. G. Gallager, "A simple derivation of the coding theorems and some applications," EEE Transactions on Information Theory, vol. 11, no. 1, pp. 3-18, 1965.
79. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
80. R. G. Gallager, "Capacity and coding for degraded broadcast channels," (in Russian), Problems of Informations on Transmission, vol. 10, no. 3, pp. 3-14, 1974.
81. R. G. Gallager, "A perspective on multiaccess channels," IEEE Transactions on Information Theory, vol. 31, no. 1, pp. 124-142, 1985.
82. R. G. Gallager, "Claude E. Shannon: A retrospective on his life, work, and impact," IEEE Transactions on Information Theory, vol. 47, no. 7, pp. 2681-2695, 2001.
83. A. E. Gamal, "The capacity of a class of broadcast channels," IEEE Transactions on Information Theory, vol. 25, no. 2, pp. 166-169, 1979.
84. S. I. Gelfand, "Capacity of one broadcast channel," (in Russian), Problems on Information Transmission, vol. 13, no. 3, pp. 106-108, 1977.
85. S. I. Gelfand and M. S. Pinsker, "Capacity of broadcast channel with one deterministic component," (in Russian), Problems on Information Transmission, vol. 16, no. 1, pp. 24-34, 1980.
86. S. I. Gelfand and M. S. Pinsker, "Coding for channel with random parameters," Problems of Control and Information Theory, vol. 8, no. 1, pp. 19-31, 1980.
87. M. Gutman, "Asymptotically optimal classification for multiple test with empirically observed statistics," IEEE Transactions on Information Theory, vol. 35, no. 2, pp. 401-408, 1989.
88. B. E. Hajek and M. B. Pursley, "Evaluation of an achievable rate region for the broadcast channel," IEEE Trans actions on Information Theory, vol. 25, pp. 36-46, 1979.
89. T. S. Han, "The capacity region of general multiple-access channel with certain correlated sources," Information and Control, vol. 40, no. 1, pp. 37-60, 1979.
90. T. S. Han, "Slepian-Wolf-Cover theorem for networks of channels," Information and Contrvl, vol. 47, no. 1, pp. 67-83, 1980.
91. T. S. Han, "The capacity region for the deterministic broadcast channel with a common message," IEEE Transactions on Information Theory, vol. 27, pp. 122-125, 1981.
92. T. S. Han, "Hypothesis testing with multiterminal data compression," IEEE Transactions on Information Theory, vol. 33, no. 6, pp. 759-772, 1987.
93. T. S. Han, "Hypothesis testing with the general source," IEEE Transactions on Information Theory, vol. 46, no. 7, pp. 2415-2427, 2000.
94. T. S. Han, Information-Spectrum Methods in Information Theory. Berlin: Springer Verlag, 2003.
95. T. S. Han and S. Amari, "Statistical inference under multiterminal data compression," IEEE Transactions on Information Theory, vol. 44, no. 6, pp. 2300-2324, 1998.
96. T. S. Han and K. Kobayashi, "A new achievable region for the interference channel," IEEE Transactions on Information Theory, vol. 27, no. 1, pp. 49-60, 1981.
97. T. S. Han and K. Kobayashi, "Exponential-type error probabilities for multiterminal hypothesis testing," IEEE Transactions on Information Theory, vol. 35, no. 1, pp. 2-13, 1989.
98. E. A. Haroutunian, "Upper estimate of transmission rate for memoryless channel with countable number of output signals under given error probability exponent," in 3rd All Union Conference on Theory of Information Transmission and Coding, Uzhgomd, Publishing House of the Uzbek Academy of Science, pp. 83-86, Tashkent, 1967. (in Russian).
99. E. A. Haroutunian, "Estimates of the error probability exponent for a semicontinuous memoryless channel," (in Russian). Problems on Information Transmission, vol. 4, no. 4, pp. 37-48, 1968.
100. E. A. Haroutunian, "On the optimality of information transmission by a channel with finite number of states known at the input," (in Russian), Izvestiya Akademii Nauk Armenii, Matematika, vol. 4, no. 2, pp. 81-90, 1969.
101. E. A. Haroutunian, "Error probability lower bound for the multiple-access communication channels," (in Russian), Problems of Information Transmission, vol. 11, no. 2, pp. 22-36, 1975.
102. E. A. Haroutunian, "Combinatorial method of construction of the upper bound for E-capacity," (in Russian), Mezhvuz. Sbornic Nouchnikh Trudov, Matematika, Yerevan, vol. 1, pp. 213-220, 1982.
103. E. A. Haroutunian, "On asymptotically optimal testing of hypotheses concerning Markov chain," (in Russian), Izvestiya Akademii Nauk Armenii, Matematika, vol. 23, no. 1, pp. 76-80, 1988.
104. E. A. Haroutunian, "Asymptotically optimal testing of many statistical hypotheses concerning Markov chain," in 5th International Vilnius Conference on Probability Theory and Mathematical Statistics, vol. 1 (A-L), pp. 202-203, 1989.
105. E. A. Haroutunian, "On asymptotically optimal criteria for Markov chains," (in Russian), First World Congress of Bernoulli Society, section 2, vol. 2, no. 3, pp. 153-156, 1989.
106. E. A. Haroutunian, "Logarithmically asymptotically optimal testing of multiple statistical hypotheses," Problems of Control and Information Theory, vol. 19, no. 5-6, pp. 413-421, 1990.
107. E. A. Haroutunian, "On Bounds for E-capacity of DMC," IEEE Transactions on Information Theory, vol. 53, no. 11, pp. 4210-4220, 2007.
108. E. A. Haroutunian and B. Belbashir, "Lower estimate of optimal transmission rates with given error probability for discrete memoryless channel and for asymmetric broadcast channel," in 6-th International Symposium on Information Theory, pp. 19-21, Tashkent, 1984. (in Russian).
109. E. A. Haroutunian and N. M. Grigoryan, "Reliability approach for testing of many distributions for pair of Markov chains," Transactions of the Institute for Informatics and Automation Problems NAS of RA, Mathematical Problems of Computer Science, vol. 29, pp. 89-96, 2007.
110. E. A. Haroutunian and P. M. Hakobyan, "On multiple hypotheses LAO testing for many independent objects," In preparation.
111. E. A. Haroutunian and P. M. Hakobyan, "On multiple hypothesis testing by informed statistician for arbitrarily varying object and application to source coding," Transactions of the Institute for Informatics and Automation Problems NAS of RA. Mathematical Problems of Computer Science, vol. 23, pp. 36-46, 2004.
112. E. A. Haroutunian and P. M. Hakobyan, "On logarithmically asymptotically optimal testing of three distributions for pair of independent objects," Transactions of the Institute for Informatics and Automation Problems NAS of RA, Mathematical Problems of Computer Science, vol. 24, pp. 76-81, 2005.
113. E. A. Haroutunian and P. M. Hakobyan, "On identification of distributions of two independent objects," Transactions of the Institute for Informatics and Automation Problems of the NAS of RA. Mathematical Problems of Computer Science, vol. 28, pp. 114-119, 2007.
114. E. A. Haroutunian and A. N. Haroutunian, "The binary Hamming rate-reliability-distortion function," Transactions on Institute for Informatics and Automation Problems NAS of RA and YSU. Mathematical Problems of Computer Science, vol. 18, pp. 40-45, 1997.
115. E. A. Haroutunian, A. N. Haroutunian, and A. R. Kazarian (Ghazaryan), "On rate-reliabilities-distortions function of source with many receivers," in Proceedings of Joint Session 6th Prague Symposium Asymptotic Statistics and 13-th Prague Conforence Information Theory, Statistical Decision Function Random Proceed. Vol. 1, pp. 217-220, Prague, 1998.
116. E. A. Haroutunian and M. E. Haroutunian, Information Theory, (in Armenian), Yerevan State University, p. 104, 1987.
117. E. A. Haroutunian and M. E. Haroutunian, "Channel with random parameter," in Proceedings of 12-th Prague Conference on Information Theory, Statistical Decision Function Random Proceedings, p. 20, 1994.
118. E. A. Haroutunian and M. E. Haroutunian, "Bounds of E-capacity region for restricted two-way channel," (in Russian), Problems of Information Transmission, vol. 34, no. 3, pp. 7-16, 1998.
119. E. A. Haroutunian, M. E. Haroutunian, and A. E. Avetissian, "Multiple-access channel achievable rates region and reliability," Izvestiya Akademii Nauk Armenii, Matematika, vol. 27, no. 5, pp. 51-67, 1992.
120. E. A. Haroutunian and A. N. Harutyunyan, "Successive refinement of information with reliability criterion," in Proceedings of IEEE International Symposium on Information Theory, p. 205, Sorrento, Italy, 2000.
121. E. A. Haroutunian, A. N. Harutyunyan, and A. R. Ghazaryan, "On rate-reliability-distortion function for robust descriptions system," IEEE Transactions on Information Theory, vol. 46, no. 7, pp. 2690-2697, 2000.
122. E. A. Haroutunian and A. R. Kazarian, "On cascade system coding rates with respect to distortion criteria and reliability," Transactions of the Institute Informatics and Automation Problems NAS of RA and YSU, Mathematical Problems of Computer Science, vol. 18, pp. 19-32, 1997.
123. E. A. Haroutunian and R. S. Maroutian, "(E, Δ)-achievable rates for multiple descriptions of random varying source," Problems of Control and Information Theory, vol. 20, no. 2, pp. 165-178, 1991.
124. E. A. Haroutunian and B. Mekoush, "Estimates of optimal rates of codes with given error probability exponent for certain sources," in 6th International Symposium on Information Theory, vol. 1, pp. 22-23, Tashkent, 1984. (in Russian).
125. E. A. Haroutunian and A. O. Yessayan, "On hypothesis optimal testing for two differently distributed objects," Transactions of the Institute for Informatics and Automation Problems NAS of RA, Mathematical Pmblems of Computer Science., vol. 25, pp. 89-94, 2006.
126. E. A. Haroutunian and A. O. Yessayan, "On logarithmically asymptotically optimal hypothesis testing for Pair of statistically dependent objects," Transactions of the Institute for Informatics and Automation Problems NAS of RA, Mathematical Problems of Computer Science, vol. 29, pp. 117-123, 2007.
127. M. E. Haroutunian, "E-capacity of arbitrarily varying channel with informed encoder," Problems of Information Transmission, (in Russian), vol. 26, no. 4, pp. 16-23, 1990.
128. M. E. Haroutunian, "Bounds of E-capacity for the channel with random parameter," Problems of Information Transmission, (in Russian), vol. 27, no. 1, pp. 14-23, 1991.
129. M. E. Haroutunian, "About achievable rates of transmission for interference channel," Transactions of the Institute for Informatics and Automation Problems NAS of RA and YSU, Mathematical Problems of Computer Science, vol. 20, pp. 79-89, 1998.
130. M. E. Haroutunian, "Random coding bound for E-capacity region of the broadcast channel," Transactions of Institute Informatics and Automation Problems NAS of RA and YSU, Mathematical Problems of Computer Science, vol. 21, pp. 50-60, 2000.
131. M. E. Haroutunian, "New bounds for E-capacities of arbitrarily varying channel and channel with random parameter," Transactions of the Institute for Informatics and Automation Problems NAS of RA and YSU, Mathematical Problems of Computer Science, vol. 22, pp. 44-59, 2001.
132. M. E. Haroutunian, "On E-capacity region of multiple-access channel," (in Russian) Izvestiya Akademii Nauk Armenii, Matematika, vol. 38, no. 1, pp. 3-22, 2003.
133. M. E. Haroutunian, "On multiple-access channel with random parameter," in Proceedings of International Conference on Computer Science and Information Technology, pp. 174-178, Yerevan, Armenia, 2003.
134. M. E. Haroutunian, "Bounds of E-capacity for multiple-access chanel with random parameter," in Lecture Notes in Computer Science, General Theory of Information Transfer and Combinatorics, pp. 166-183, Springer Verlag, 2005.
135. M. E. Haroutunian and A. H. Amirbekyan, "Random coding bound for E-capacity region of the channel with two inputs and two outputs," Transactions of the Institute for Informatics and Automation Problems NAS of RA and YSU. Mathematical Problems of Computer Science, vol. 20, pp. 90-97, 1998.
136. M. E. Haroutunian and S. A. Tonoyan, "On estimates of rate-reliabilitydistortion function for information hiding system," Transactions of the Institute, for Informatics and Automation Problems NAS of RA and YSU. Mathematical Problems of Computer Science, vol. 23, pp. 20-31, 2004.
137. M. E. Haroutunian and S. A. Tonoyan, "Random coding bound of information hiding E-capacity," Transactions of IEEE International Symposium Information Theory, Chicago, USA, p. 536, 2004.
138. M. E. Haroutunian and S. A. Tonoyan, "On information hiding system with multiple messages," Transactions of the Institute for Informatics and Automation Problems NAS of RA and YSU. Mathematical Problems of Computer Science, vol. 24, pp. 89-103, 2005.
139. M. E. Haroutunian, S. A. Tonoyan, O. Koval, and S. Voloshynovskiy, "Random coding bound of reversible information hiding E-capacity," Transactions of the Institute for Informatics and Automation Problems NAS of RA and YSU. Mathematical Problems of Computer Science, vol. 28, pp. 18-33, 2007.
140. A. N. Haroutunian (Harutyunyan) and E. A. Haroutunian, "An achievable rates-reliabilities-distortions dependence for source coding with three descriptions," Transactions of the Institute for Informatics and Automation Problems NAS of RA and YSU, Mathematical Problems of Computer Science, vol. 17, pp. 70-75, 1997.
141. A. N. Harutyunyan, "Notes on conditions for successive refinement of information," in Lecture Notes in Computer Science. General Theory of Information Transfer and Combinatorics, pp. 130-138, Springer Verlag, 2006.
142. A. N. Harutyunyan and A. J. Han Vinck, "Error exponent in AVS coding," in Proceedings of IEEE International Symposium on Information Theory, pp. 2166-2170. Seattle, WA, July 9-14 2006.
143. A. N. Harutyunyan and E. A. Haroutunian. "On properties of rate-reliability-distortion function." IEEE Transactions on Information Theory, vol. 50, no. 11, pp. 2768-2769, 1996.
144. A. S. Hekstra and F. M. J. Willems, "Dependence balance bounds for singleoutput two-way channel," IEEE Transactions on Information Theory, vol. 35, no. 1, pp. 44-53, 1989.
145. W. Hoeffding, "Asymptotically optimal tests for multinomial distributions." Annals of Mathematical Statistics, vol. 36, pp. 369-401, 1965.
146. B. L. Hughes and T. G. Thomas, "On error exponents for arbitrarily varying channels," IEEE Transactions on Information Theory, vol. 42, no. 1, pp. 87-98, 1996.
147. S. Ihara, Information Theory for Continuous Systems. Singapore: World Scientific, 1993.
148. P. Jacket and W. Szpankovksi, "Markov types and minimax redundancy for Markov sources," IEEE Transactions on Information Theory, vol. 50, no. 7, pp. 1393-1402, 2004.
149. J. Jahn, "Coding of arbitrarily varying multiuser channels," IEEE Transactions on Information Theory, vol. 27, no. 2, pp. 212-226, 1981.
150. F. Jelinek, "Evaluation of expurgated bound exponents," IEEE Transactions on Information Theory, vol. 14, pp. 501-505, 1968.
151. A. Kanlis and P. Narayan, "Error exponents for successive refinement by partitioning," IEEE Transactions on Information Theory, vol. 42, no. 1, pp. 275-282, 1996.
152. V. D. Kolesnik and G. S. Poltirev, Textbook of Information Theory, (in Russian), Nauka, Moscow, 1982.
153. J. Körner and K. Marton, "General broadcast channels with degraded message sets," IEEE Transactions on Information Theory, vol. 23, pp. 60-64, 1977.
154. J. Körner and A. Sgarro, "Universally attainable error exponents for broadcast channels with degraded message sets," IEEE Transactions on Information Theory, vol. 26, pp. 670-679, 1980.
155. V. N. Koshelev, "Multilevel source coding and data-transmission theorem," in Proceedings of VII All-Union Conference on Theory of Coding and Data lYansmission, pp. 85-92, Vilnius, U.S.S.R., pt. 1, 1978.
156. V. N. Koshelev, "Hierarchical coding of discrete sources," (in Russian), Problems of Information Transmission, vol. 16, no. 3, pp. 31-49, 1980.
157. V. N. Koshelev, "An evaluation of the average distortion for discrete scheme of sequential approximation," (in Russian), Problems on Information Transmission, vol. 17, no. 3, pp. 20-30, 1981.
158. V. N. Koshelev, "On divisibility of discrete sources with the single-letter-additive measure of distortion," Problems on Information Transmission, vol. 30, no. 1, pp. 31-50, (in Russian), 1994.
159. B. D. Kudryashov and G. S. Poltyrev, "Upper bounds for decoding error probability in some broadcast channels," (in Russian), Problems on Information Transmission, vol. 15, no. 3, pp. 3-17, 1979.
160. S. Kullback, Information Theory and Statistics. New York: Wiley, 1959.
161. E. Levitan and N. Merhav, "A competitive Neyman-Pearson approach to universal hypothesis testing with applications," IEEE Transactions on Information Theory, vol. 48, no. 8, pp. 2215-2229, 2002.
162. Y. Liang and G. Kramer, "Rate regions for relay broadcast channels," IEEE Transactions on Information Theory, vol. 53, no. 10, pp. 3517-3535, 2007.
163. Y. N. Lin'kov, "On asymptotical discrimination of two simple statistical hypotheses," (in Russian), Preprint 86.45, Kiev, 1986.
164. Y. N. Lin'kov, "Methods of solving asymptotical problems of two simple statistical hypotheses testing," (in Russian), Preprint 89.05, Doneck, 1989.
165. Y. N. Lin'kov, Asymptotical Methods of Random Processes Statistics, (in Russian). Naukova Dumka, Kiev, 1993.
166. Y. S. Liu and B. L. Hughes, "A new universal coding bound for the multiple-access channel," IEEE Transactions on Information Theory, vol. 42, pp. 376-386, 1996.
167. G. Longo and A. Sgarro, "The error exponent for the testing of simple statistical hypotheses: A combinatorial approach," Journal of Combinatories, Informational System Sciences, vol. 5, no. 1, pp. 58-67, 1980.
168. A. A. Lyapunov, "On selection between finite number of distributions," (in Russian), Uspekhi Matematicheskikh Nauk, vol. 6, no. 1, pp. 178-186, 1951.
169. I. Marić, R. D. Yates, and G. Kramer, "Capacity of interference channels with partial transmitter cooperation," IEEE Transactions on Information Theory, vol. 53, no. 10, pp. 3536-3548, 2007.
170. R. S. Maroutian, "Achievable rates for multiple descriptions with given exponent and distortion levels," (in Russian), Problems on Information Transmission, vol. 26, no. 1, pp. 83-89, 1990.
171. K. Marton, "Error exponent for source coding with a fidelity criterion," IEEE Transactions on Information Theory, vol. 20, no. 2, pp. 197-199, 1974.
172. K. Marton, "A coding theorem for the discrete memoryless broadcast channel," IEEE IYansactions on Information Theory, vol. 25, pp. 306-311, 1979.
173. U. M. Maurer, "Authentication theorey and hypothesis testing," IEEE Transactions on Information Theory, vol. 46, no. 4, pp. 1350-1356, 2000.
174. N. Merhav, "On random coding error exponents of watermarking systems," IEEE IYansactions on Information Theory, vol. 46, no. 2, pp. 420-430, 2000.
175. P. Moulin and J. A. O'Sullivan, "Information theoretic analysis of information hiding," IEEE Transactions on Information Theory, vol. 49, no. 3, pp. 563-593, 2003.
176. P. Moulin and Y. Wang, "Capacity and random-coding exponents for channel coding with side information," IEEE Transactions on Information Theory, vol. 53, no. 4, pp. 1326-1347, 2007.
177. S. Natarajan, "Large deviations, hypotheses testing, and source coding for finite Markov chains," IEEE Transactions on Information Theory, vol. 31, no. 3, pp. 360-365, 1985.
178. J. K. Omura, "A lower bounding method for channel and source coding probabilities," Information and Control, vol. 27, pp. 148-177, 1975.
179. A. Peres, "Second-type-error exponent given the first-type-error exponent in the testing statistical hypotheses by unfitted procedures," in 6th International Symposium on Information Theory, pp. 277-279, Tashkent, Part 1, 1984.
180. M. S. Pinsker, "Capacity of noiseless broadcast channels," Problems on Information Transmission, (in Russian), vol. 14, no. 2, pp. 28-34, 1978.
181. M. S. Pinsker, "Multi-user channels," in II Joint Swedish-Soviet International workshop on Information Theory, pp. 160-165, Gränna, Sweden, 1985.
182. J. Pokorny and H. M. Wallmeier, "Random coding bound and codes produced by permutations for the multiple-access channel," IEEE Transactions on Information Theory, vol. 31, pp. 741-750, 1985.
183. G. S. Poltyrev, "Random coding bounds for some broadcast channels," (in Russian), Problems on Information Transmission, vol. 19, no. 1, pp. 9-20, 1983.
184. H. V. Poor and S. Verdú, "A lower bound on the probability of error in multihypothesis testing," IEEE Transactions on Information Theory, vol. 41, no. 6, pp. 1992-1995, 1995.
185. V. V. Prelov, "Information transmission by the multiple access channel with certain hierarchy of sources," (in Russian), Problems on Information Transmission, vol. 20, no. 4, pp. 3-10, 1984.
186. Puhalskii and Spokoiny, "On large deviation efficiency in statistical inference," Bernoulli, vol. 4, no. 2, pp. 203-272, 1998.
187. B. Rimoldi, "Successive refinement of information: Characterization of the achievable rates," IEEE 'Transactions on Information Theory, vol. 40, no. 1, pp. 253-259, 1994.
188. H. Sato, "Two-user communication channels," IEEE Transactions on Information Theory, vol. 23, no. 3, pp. 295-304, 1977.
189. H. Sato, "On the capacity region of a discrete two-user channel for strong interference," IEEE Transactions on Information Theory, vol. 3, pp. 377-379, 1978.
190. H. Sato, "An outer bound to the capacity region of broadcast channel," IEEE IYansactions on Information Theory, vol. 24, pp. 374-377, 1979.
191. C. E. Shannon, "A mathematical theory of communication," Bell System Technical Journal, vol. 27, no. 3, pp. 379-423, 1948.
192. C. E. Shannon, "The zero-error capacity of a noisy channel," IRE Transactions on Information Theory, vol. 2, no. 1, pp. 8-19, 1956.
193. C. E. Shannon, "Channel with side information at the transmitter," IBM Journal on Research and Development, vol. 2, no. 4, pp. 289-293, 1958.
194. C. E. Shannon, "Coding theorems for a discrete source with a fidelity criterion," IRE National Convention Record, vol. 7, pp. 142-163, 1959.
195. C. E. Shannon, "Probability of error for optimal codes in a Gaussian channel," Bell System Technical Journal, vol. 38, no. 5, pp. 611-656, 1959.
196. C. E. Shannon, "Two-way communication channels," in Proceedings of 4th Berkeley Symposium on Mathematical Statistics and Probability, pp. 611-644, Berkeley: University of California Press, 1961.
197. C. E. Shannon, "Works on information theory and cybernetics," in Collection of Papers, (R. L. Dobrushin and O. B. Lupanov, eds.), Moscow: Publishing House of Foreign Literature, 1963. (in Russian).
198. C. E. Shannon, R. G. Gallager, and E. R. Berlekamp, "Lower bounds to error probability for coding in discrete memoryless channel," Information and Control, vol. 10, no. 1, pp. 65-103, no. 2, pp. 523-552, 1967.
199. D. Slepian and J. K. Wolf, "A coding theorem for multiple access channels with correlated sources," Bell System Technical Journal, vol. 52, pp. 1037-1076, 1973.
200. A. Somekh-Baruch and N. Merhav, "On error exponent and capacity games of private watermarking systems," IEEE Transactions on Information Theory, vol. 49, no. 3, pp. 537-562, 2003.
201. A. Somekh-Baruch and N. Merhav, "On the capacity game of public watermarking systems," IEEE Transactions on Information Theory, vol. 50, no. 3, pp. 511-524, 2004.
202. A. Somekh-Baruch and N. Merhav, "On the random coding error exponents of the single-user and the multiple-access Gelfand-Pinsker channels," in Proceedings of IEEE International Symposium on Information Theory, p. 448, Chicago, USA, 2004.
203. H. H. Tan, "Two-user interference channels with correlated information sources," Information and Control, vol. 44, no. 1, pp. 77-104, 1980.
204. S. A. Tonoyan, "Computation of information hiding capacity and E-capacity lower bounds," Transactions of the Institute for Informatics and Automation Problems NAS of RA and YSU, Mathematical Problems of Computer Science, vol. 26, pp. 33-37, 2006.
205. E. Tuncel, "On error exponent in hypothesis testing," IEEE Transactions on Information Theory, vol. 51, no. 8, pp. 2945-2950, 2005.
206. E. Tuncel and K. Rose, "Error exponents in scalable source coding," IEEE IYansactions on Information Theory, vol. 49, pp. 289-296, January 2003.
207. G. Tusnády, "On asymptotically optimal tests," Annals of Statistics, vol. 5, no. 2, pp. 385-393, 1977.
208. G. Tusnády, "Testing statistical hypoteses (an information theoretic aproach)," Preprint, Mathematical Institute Hungarian Academy Sciences, Budapest, 1979, 1982.
209. E. C. van der Meulen, "The discrete memoryless channel with two senders and one receiver," in Pmceedings of 2nd International Symposium on Information Theory, Tsahkadzor, Armenia, 1971, pp. 103-135, Budapest: Akad. Kiado, 1973.
210. E. C. van der Meulen, "Random coding theorems for the general discrete memoryless broadcast channel," IEEE Transactions on Information Theory, vol. 21, pp. 180-190, 1975.
211. E. C. van der Meulen, "A Survey of multi-way channels in information theory: 1961-1976," IEEE Transactions on Information Theory, vol. 23, no. 1, pp. 1-37, 1977.
212. E. C. van der Meulen, "Some recent results on the asymmetric multiple-access channel," in Proceedings of 2nd Joint Swedish-Soviet International Workshop on Information Theory, pp. 172-176, Granna, Sweden, 1985.
213. E. C. van der Meulen, E. A. Haroutunian, A. N. Harutyunyan, and A. R. Ghazaryan, "On the rate-reliability-distortion and partial secrecy region of a one-stage branching communication system," in Proceedings of IEEE International Symposium on Information Theory, p. 211, Sorrento, Italy, 2000.
214. S. Verdú, "Asymptotic error probability of binary hypothesis testing for poisson point-process observations," IEEE Transactions on Information Theory, vol. 32, no. 1, pp. 113-115, 1986.
215. S. Verdú, "Guest Editorial," IEEE Transactions on Information Theory, vol. 44, no. 6, pp. 2042-2043, 1998.
216. S. Verdú, Multiuser Detection. Cambridge University Press, 1998.
217. F. M. J. Willems, Information Theoretical Results for the Discrete Memoryless Multiple Access Channel. PhD thesis, Katholieke University Leuven, 1982.
218. F. M. J. Willems, "The maximal-error and average-error capacity region of the broadcast channel are identical," Problems of Control and Information Theory, vol. 19, no. 4, pp. 339-347, 1990.
219. F. M. J. Willems and E. C. van der Meulen, "The discrete memoryless multiple-access channel with cribbing encoders," IEEE Transactions on Information Theory, vol. 31, no. 3, pp. 313-327, 1985.
220. J. Wolf, A. D. Wyner, and J. Ziv, "Source coding for multiple description," Bell System Technical Journal, vol. 59, no. 8, pp. 1417-1426, 1980.
221. J. Wolfowitz, "Simultaneous channels," Archive for Rational Mechanics and Analysis, vol. 4, no. 4, pp. 371-386, 1960.
222. J. Wolfowitz, Coding Theorems of Information Theory. Berlin-Heidelberg: Springer Verlag, 3rd ed., 1978.
223. H. Yamamoto, "Source coding theory for cascade and branching communication systems," IEEE Transactions on Information Theory, vol. 27, no. 3, pp. 299-308, 1981.
224. R. Yeung, A First Course in Information Theory. New York: Kluwer Academic, 2002.
225. O. Zeitouni and M. Gutman, "On universal hypotheses testing via large deviations," IEEE Transactions on Information Theory, vol. 37, no. 2, pp. 285-290, 1991.
226. Z. Zhang and T. Berger, "New results in binary multiple description," IEEE Transactions on Information Theory, vol. 33, no. 4, pp. 502-521, 1987.
227. Z. Zhang and T. Berger, "Estimation via compressed information," IEEE IYansactions on Information Theory, vol. 34, no. 2, pp. 198-211, 1988.
228. Z. Zhang, T. Berger, and J. P. M. Schalkwijk, "New outer bounds to capacity regions of two-way channels," IEEE Transactions on Information Theory, vol. 32, no. 3, pp. 383-386, 1986.
229. J. Ziv, "On classification with empirically observed statistics and universal data compression," IEEE IYansactions on Information Theory, vol. 34, no. 2, pp. 278-286, 1988.
230. G. Zoutendijk, Methods of Feasible Directions. A Study in Linear and NonLinear Programming. Amsterdam: Elsevier, 1960.