ICAR Research Data Repository for Knowledge Management
Feasible alphabets for communicating the sum of sources over a network
DSpace at IIT Bombay
View Archive Info| Field | Value | |
| Title |
Feasible alphabets for communicating the sum of sources over a network
|
|
| Creator |
RAI, BK
DEY, BK |
|
| Subject |
information-flow
|
|
| Description |
We consider directed acyclic sum-networks with In sources and n terminals where the sources generate symbols from an arbitrary alphabet field F, and the terminals need to recover the sum of the sources over F. We show that for any co-finite set of primes, there is a sum-network which is linearly solvable only over fields of characteristics belonging to that set. We further construct a sum-network where a scalar linear solution exists over all fields other than the binary field F(2). We also show that a sum-network is linearly solvable over a field if and only if its reverse network is linearly solvable over the same field.
|
|
| Publisher |
IEEE
|
|
| Date |
2011-10-25T00:04:58Z
2011-12-15T09:11:50Z 2011-10-25T00:04:58Z 2011-12-15T09:11:50Z 2009 |
|
| Type |
Proceedings Paper
|
|
| Identifier |
2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4,1353-1357
978-1-4244-4312-3 http://dx.doi.org/10.1109/ISIT.2009.5205921 http://dspace.library.iitb.ac.in/xmlui/handle/10054/15549 http://hdl.handle.net/100/2319 |
|
| Source |
IEEE International Symposium on Information Theory (ISIT 2009),Seoul, SOUTH KOREA,JUN 28-JUL 03, 2009
|
|
| Language |
English
|
|