A new sphere-packing bound for maximal error exponent for multiple-access channels

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2008, Pages 1513-1517

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

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNATIONAL SYMPOSIUM; LOWER BOUNDS; MAXIMAL ERRORS; MULTIPLE-ACCESS CHANNELS; SPHERE PACKINGS; SPHERE-PACKING BOUNDS; TIME-SHARING;

CONTROL THEORY; CYBERNETICS; INFORMATION THEORY; PROBABILITY DISTRIBUTIONS; SPHERES; TECHNICAL PRESENTATIONS;

PROBABILITY;

EID: 52349101126     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2008.4595240     Document Type: Conference Paper

References (13)

1. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: John Wiley & Sons, 1991.
2. 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.
3. E. A. Haroutunian. "Lower bound for the error probability of multipleaccess channels," Problemy Peredachi Informatsii. vol. 11, pp. 23-36, June 1975.
4. G. Dueck, "The strong converse of the coding theorem for the multi-user channels," Journal of Combinatorics, Information and System sciences, pp. 187-196, 1981.
5. I. Csiszar and J. Korner, Information theory: Coding theorems for Discrete memoryless Systems., 1981.
6. R. Ahlswede, "On two-way communication channels and a problem by Zarankiewics," in Probl. of Control and, Inform. Theory.
7. "An elementary proof of the strong converse theorem for the multiple access channel," Journal of Combinatorics, Information and System sciences, pp. 216-230, 1982.
8. A. Fedotov, P. Harremoës, and F. Topsøe, "Refinements of Pinsker's inequality," IEEE Trans. Information Theory, vol. 49, no. 6, pp. 1491-1498, June 2003.
9. U. Augustin, "Gedachtnisfreie kannale for diskrete zeit," Z. Wahrscheinlichkelts theory verw, pp. 10-61, 1966.
10. A. Nazari, S. S. Pradhan, and A. Anastasopoulos, "A new spherepacking bound for maximal error exponent for multiple-access channels." in Proc. IEEE Int. Symp. Inf. Theory. July 2008, online: http://arxiv.org/abs/0803.3645.
11. R. Ahlswede, "The rate-distortion for multiple description without excess rates," IEEE Trans. Information Theory, vol. 31, no. 6, pp. 721-726, Nov. 1985.
12. H. G. Eggleston, Convexity. Cambridge, UK: Cambridge University Press, 1969.
13. B. Grünbaum, Convex Polytopes. New York: McGraw-Hill, 1976.