Interactive source coding for function computation in collocated networks

IEEE Transactions on Information Theory

Volumn 58, Issue 7, 2012, Pages 4289-4305

  Ma, Nan ^a   Ishwar, Prakash ^b   Gupta, Piyush ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Boston University   (United States)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

Collocated networks; communication complexity; distributed source coding; function computation; interactive coding

Indexed keywords

BERNOULLI; BINARY SOURCES; BLOCK SOURCE CODING; COMMUNICATION COMPLEXITY; CONCEPTUAL UNDERSTANDING; DISTRIBUTED SOURCE CODING; FUNCTIONALS; INFORMATION MEASURES; INTERACTIVE CODING; INTERACTIVE FUNCTIONS; ITERATIVE ALGORITHM; JOINT SOURCE; LOWER BOUNDS; NETWORK SCALE; OPTIMALITY; PROBABILITY MASS FUNCTION; SOURCE NODES; SOURCE PARAMETERS; SOURCE-CODING; SUM-RATE; SYMMETRIC FUNCTIONS;

ALGORITHMS; CHARACTERIZATION; COMMUNICATION CHANNELS (INFORMATION THEORY);

DISTRIBUTED COMPUTER SYSTEMS;

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

References (20)

1. A. Giridhar and P. Kumar, "Computing and communicating functions over sensor networks," IEEE J. Sel. Areas Commun., vol. 23, no. 4, pp. 755-764, Apr. 2005.
2. S. Subramanian, P.Gupta, and S. Shakkottai, "Scaling bounds for function computation over large networks," in Proc. IEEE Int. Symp. Inf. Theory, Nice, France, Jun. 24-29, 2007, pp. 136-140.
3. R. Appuswami, M. Franceschetti, N. Karamchandani, and K. Zeger, "Network coding for computing," in Proc. 46th Annu. Allerton Conf. Commun., Control, Computing, Monticello, IL, Sep. 23-26, 2008, pp. 1-6.
4. V. Prabhakaran, K. Ramchandran, and D. Tse, "On the role of interaction between sensors in the CEO problem," in 42th Annu. Allerton Conf. Commun., Control, Computing, Monticello, IL, Sep. 29 -Oct. 1, 2004.
5. A. H. Kaspi, "Two-way source coding with a fidelity criterion," IEEE Trans. Inf. Theory, vol. 31, no. 6, pp. 735-740, Nov. 1985.
6. A. Orlitsky and J. R. Roche, "Coding for computing," IEEE Trans. Inf. Theory, vol. 47, no. 3, pp. 903-917, Mar. 2001.
7. N. Ma and P. Ishwar, "Two-terminal distributed source coding with alternating messages for function computation," in Proc. IEEE Int. Symp. Inf. Theory, Toronto, ON, Canada, Jul. 6-11, 2008, pp. 51-55.
8. N. Ma and P. Ishwar, "Infinite-message distributed source coding for two-terminal interactive computing," in Proc. 47th Annu. Allerton Conf. Commun., Control, Computing, Monticello, IL, Sep. 30-Oct. 7, 2009, pp. 1510-1517.
9. N. Ma and P. Ishwar, "Interaction strictly improves the Wyner-Ziv rate-distortion function," in Proc. IEEE Int. Symp. Inf. Theory, Austin, TX, Jun. 13-18, 2010, pp. 61-65.
10. I. Csiszár and P. Narayan, "Secrecy capacities for multiple terminals," IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 3047-3061, Dec. 2004.
11. R. Gallager, "Finding parity in a simple broadcast network," IEEE Trans. Inf. Theory, vol. 34, no. 2, pp. 176-180, Mar. 1988.
12. L. Ying, R. Srikant, and G. Dullerud, "Distributed symmetric function computation in noisy wireless sensor networks," IEEE Trans. Inf. Theory, vol. 53, no. 12, pp. 4826-4833, Dec. 2007, submitted for publication.
13. O. Ayaso, D. Shah, and M. Dahleh, "Information theoretic bounds for distributed computation over networks of point-to-point channels," IEEE Trans. Inf. Theory, vol. 56, no. 12, pp. 6020-6039, Dec. 2010.
14. B. Nazer and M. Gastpar, "Computation over multiple-access channels," IEEE Trans. Inf. Theory, vol. 53, no. 10, pp. 3498-3516, Oct. 2007.
15. R. T. Rockafellar, Convex Analysis. Princeton, NJ: Princeton Univ. Press, 1970.
16. E. Kushilevitz and N. Nisan, Communication Complexity. Cambridge, U.K.: Cambridge Univ. Press, 1997.
17. J. Körner and K. Marton, "How to encode the modulo-two sum of binary sources," IEEE Trans. Inf. Theory, vol. 25, no. 2, pp. 219-221, Mar. 1979.
18. T. S. Han and K. Kobayashi, "A dichotomy of functions of correlated sources from the viewpoint of the achievable rate region," IEEE Trans. Inf. Theory, vol. 33, no. 1, pp. 69-76, Jan. 1987.
19. T. M. Cover and J.A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
20. J. E. Pecaric, F. Proschan, and Y. L. Tong, Convex Functions, Partial Orderings, and Statistical Applications. New York: Academic, 1992.