Computing polynomial functions of correlated sources: Inner bounds
This paper considers the problem of source coding for computing functions of correlated i.i.d. random sources. The approach of combining standard and linear random coding for this problem was first introduced by Ahlswede and Han, in the special case of computing the modulo-two sum. In this paper, ma...
Saved in:
| Published in: | 2012 International Symposium on Information Theory and Its Applications pp. 160 - 164 |
|---|---|
| Main Authors: | , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
IEEE
01.10.2012
|
| Subjects: | |
| ISBN: | 9781467325219, 146732521X |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!

