A graph-based framework for transmission of correlated sources over multiple-access channels

IEEE Transactions on Information Theory

Volumn 53, Issue 12, 2007, Pages 4583-4604

  Pradhan, S Sandeep ^a   Choi, Suhan ^a,b   Ramchandran, Kannan ^c  

^a UNIVERSITY OF MICHIGAN   (United States)

^b SAMSUNG Electronics   (South Korea)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Discrete interface; Distributed source coding; Multiple access channels; Random graphs

Indexed keywords

BIPARTITE GRAPHS; CODE-WORDS; CORRELATED SOURCES; CORRELATION STRUCTURES; DISCRETE INTERFACE; DISTRIBUTED SOURCE CODING; EXPONENTIAL GROWTHS; GRAPH-BASED; JOINT SOURCE-CHANNEL CODING; MULTI-USER CHANNELS; MULTI-USER COMMUNICATIONS; MULTIPLE-ACCESS CHANNELS; PERFORMANCE GAINS; PERFORMANCE LOSS; RANDOM GRAPHS; SOURCE-CODING; TRANSMISSION SYSTEMS;

CHANNEL CODING; INFORMATION THEORY;

GRAPH THEORY;

EID: 46749138958     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2007.909093     Document Type: Article

References (38)

1. R. Ahlswede, "Multi-way communication channels," in Proc. 2nd Int. Symp. Information Theory, Tsahkadsor, S.S.R. Armenia, 1971, pp. 23-52.
2. H. Liao, "A coding theorem for multiple access communications," in Proc. Int. Symp. Information Theory, Asilomar, CA, 1972, See also "Multiple Access Channels," Ph.D. dissertation, Dept. Elec. Eng., Univ. Hawaii, Honolulu, 1972.
3. E. C. M. Van der Meulen, "The discrete memoryless channel with two senders and one receiver," in Proc. 2nd Int. Symp. Information Theory, Tsahkadsor, S.S.R. Armenia, 1971, pp. 103-135.
4. R. Ahlswede, "The capacity region of a channel with two senders and two receivers," Ann. Probab., vol. 2, pp. 805-814, Oct. 1974.
5. R. Ahlswede, "An elementary proof of the strong converse theorem for the multiple-access channel," J. Comb. Inf. Syst. Sci., vol. 7, pp. 216-230, 1982.
6. D. Slepian and J. K. Wolf, "Noiseless coding of correlated information sources," IEEE Trans. Inf. Theory, vol. IT-19, no. 4, pp. 471-480, Jul. 1973.
7. T. M. Cover, "A proof of the data compression theorem of Slepian and Wolf for ergodic sources," IEEE Trans. Inf. Theory, vol. IT-21, no. 2, pp. 226-228, Mar. 1975.
8. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
9. 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, Sep. 1973.
10. T. M. Cover, A. El Gamal, and M. Salehi, "Multiple-access channel with arbitrarily correlated sources," IEEE Trans. Inf. Theory, vol. IT-26, no. 6, pp. 648-657, Nov. 1980.
11. P. Gacs and J. Körner, "Common information is much less than mutual information," Probl. Contr. Inf. Theory, vol. 2, pp. 149-162, 1973.
12. H. S. Witsenhausen, "On sequences of pairs of dependent random variables," SIAM J. Appl. Math., vol. 28, pp. 100-113, Jan. 1975.
13. A. D. Wyner, "The common information of two dependent random variables," IEEE Trans. Inf. Theory, vol. IT-21, no. 2, pp. 163-179, Mar. 1975.
14. S. Vembu, S. Verdu, and Y. Steinberg, "The source-channel separation theorem revisited," IEEE Trans. Inf. Theory, vol. 41, no. 1, pp. 44-54, Jan. 1995.
15. G. Dueck, "A note on the multiple-access channel with correlated sources," IEEE Trans. Inf. Theory, vol. IT-27, no. 2, pp. 232-235, Mar. 1981.
16. T. S. Han, "The capacity region of general multiple-access channel with certain correlated sources," Inf. Contr., vol. 40, pp. 37-60, 1979.
17. F. Willems, "The discrete memoryless multiple-access channel with partially cooperating encoders," IEEE Trans. Inf. Theory, vol. IT-29, no. 3, pp. 441-445, May 1983.
18. K. De Bruyn, V. V. Prelov, and E. C. Van der Meulen, "Reliable transmission of two correlated sources over an asymmetric multiple-access channel," IEEE Trans. Inf. Theory, vol. IT-33, no. 5, pp. 716-718, Sep. 1987.
19. W. Kang and S. Ulukus, "A single-letter upper bound for the sum rate of multiple-access channels with correlated sources," in Proc. 39th Asilomar Conf. Signals, Systems and Computers, Pacific Grove, CA, Oct. 2005.
20. J. H. van Lint and R. M. Wilson, A Course in Combinatorics. Cambridge, U.K.: Cambridge Univ. Press, 2003.
21. R. P. Stanley, Enumerative Combinatorics. Cambridge, U.K.: Cambridge Uni. Press, 2002.
22. R. Ahlswede and T. S. Han, "On source coding with side information via a multiple-access channel and related problems in multi-user information theory," IEEE Trans. Inf. Theory, vol. IT-29, no. 3, pp. 396-412, May 1983.
23. G. Dueck, "Maximal error capacity regions are smaller than average error capacity regions for multiuser channels," Probl. Contr. and Inf. Theory, vol. 7, pp. 11-19, 1978.
24. S. Janson, T. Luczak, and A. Rucinski, Random Graphs. New York: Wiley, 2000.
25. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Sources. New York: Academic, 1981.
26. B. Wang and F. Zhang, "On the precise number of (0,1)-matrices in U(r,S)," Discr. Math., vol. 187, pp. 211-220, 1998.
27. B. R. Perez-Salvador, S. de-los Cobos-Silva, M. A. Gutierrez-Andrade, and A. Torres-Chazaro, "A reduced formula for the precise number of (0,1)-matrices in A(r,S)," Discr. Math., vol. 256, pp. 361-372, 2002.
28. B. McKay, "Practical graph isomorphism," Congressus Numerantium, vol. 30, pp. 45-87, 1981.
29. D. G. Corneil and C. C. Gottlieb, "An efficient algorithm for graph isomorphism," J. ACM, vol. 17, pp. 51-64, 1970.
30. E. M. Luks, "Isomorphism of graphs of bounded valence can be tested in polynomial time," J. Comp. Syst. Scie., vol. 25, pp. 42-65, 1982.
31. Y. Liu and B. L. Hughes, "A new universal random coding bound for the multiple-access channel," IEEE Trans. Inf. Theory, vol. 42, no. 2, pp. 376-386, Mar. 1996.
32. T. M. Cover and A. El Gamal, "Achievable rates for multiple descriptions," IEEE Trans. Inf. Theory, vol. IT-28, no. 6, pp. 851-857, Nov. 1982.
33. D. Krithivasan and S. S. Pradhan, "On certain large deviation analysis of sampling from typical sets," in Proc. Workshop on Information Theory and Applications (ITA), San Diego, CA, 2007.
34. S. S. Pradhan and K. Ramchandran, "On functional duality in multiuser source and channel coding problems with one-sided collaboration," IEEE Trans. Inf. Theory, vol. 52, no. 7, pp. 2986-3002, Jul. 2006.
35. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
36. A. D. Wyner, "The rate-distortion function for source coding with side information at the decoder-II: General sources," Inf. Contr., vol. 38, pp. 60-80, 1979.
37. T. Berger, Multiterminal Source Coding. In: The Information Theory Approach to Communications (ed. G. Longo), CISM Courses and Lecture Notes. New York/Wien: Springer, 1977.
38. K. H. Rosen, Discrete Mathematics and Its Applications. New York: Mc Graw-Hill, 2003.