When do only sources need to compute? On functional compression in tree networks
In this paper, we consider the problem of functional compression for an arbitrary tree network. Suppose we have k possibly correlated source processes in a tree network, and a receiver in its root wishes to compute a deterministic function of these processes. Other nodes of this tree (called interme...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Institute of Electrical and Electronics Engineers
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/59303 https://orcid.org/0000-0002-0964-0616 https://orcid.org/0000-0003-4059-407X |