A new universal random-coding bound for average probability error exponent for multiple-access channels

Proceedings - 43rd Annual Conference on Information Sciences and Systems, CISS 2009

Volumn , Issue , 2009, Pages 295-300

  Nazari, Ali ^a   Anastasopoulos, Achilleas ^a   Pradhan, S Sandeep ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AVERAGE ERROR PROBABILITY; INPUT AND OUTPUTS; MULTIPLE ACCESS CHANNELS; PROBABILITY ERRORS; UPPER BOUND;

INFORMATION SCIENCE;

PROBABILITY;

EID: 70349673586     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CISS.2009.5054734     Document Type: Conference Paper

References (16)

1. R. Ahlswede, "Multi-way communication channels," in Proc. International Symposium on Information Theory, 1971.
2. H. Liao, "A coding theorem for multiple-access communications," in Proc. International Symposium on Information Theory.
3. D. Slepian and J. K. Wolf, "A coding theorem for multiple access channels with correlated sources," bell Syst. tech. J., vol. 52, pp. 1037-1076, 1973.
4. R. G. Gallager, Transmission of Information: A Statistical Theory of Communication. MIT Press, 1961.
5. R. Gallager, "The random coding bound is tight for the average code," IEEE Trans. Information Theory, vol. 23, no. 2, pp. 244-246, Mar. 1973.
6. A. Barg and D. Forney, "Random codes: Minimum distances and error exponents," IEEE Trans. Information Theory, vol. 48, no. 9, pp. 2568-2573, Sept. 2002.
7. I. Csiszar and J. Korner, Information theory: Coding theorems for Discrete memoryless Systems., 1981.
8. A. G. Dyachkov, "Random constant composition codes for multiple-access channels," Probl. of Control and Inform. Theory, pp. 357-369, 1984.
9. R. Gallager, "A perspective on multi-access channels," IEEE Trans. Information Theory, vol. 31, no. 2, pp. 124-142, Mar. 1985.
10. J. Pokorney and H. S. Wallmeier, "Random coding bounds and codes produced by permutations for the multiple-access channels," IEEE Tram. Information Theory, vol. 31, no. 6, pp. 741-750, Nov. 1985.
11. Y. Liu and B. L. Hughes, "A new universal random coding bound for the multiple-access channels," IEEE Trans. Information Theory, vol. 42, no. 2, pp. 376-386, Mar. 1996.
12. E. A. Haroutunian, "Lower bound for the error probability of multiple-access channels," Problemy Peredachi Informatsii, vol. 11, pp. 23-36, June 1975.
13. A. Nazari, S. S. Pradhan, and A. Anastasopoulous, "A new sphere-packing bound for maximal error exponent for multiple-access channels," in Proc. International Symposium on Information Theory, 2008, online: http://arxiv.org/abs/0803.3645.
14. R. G. Gallager, Information theory and Reliable Communications. New York: John Wiley & Sons, 1968.
15. A. Nazari, A. Anastasopoulos, and S. S. P. and, "A new universal random-coding bound for average probability error exponent for multiple-access channels." in Proc. Conference on Information Sciences and Systems, MAr 2009, online: http://arxiv.org/.
16. I. Csiszar and J. Korner, "Graph decomposition: A new key to coding theorems," IEEE Trans. Information Theory, vol. 1, pp. 5-12, Jan. 1981.