ICAR Research Data Repository for Knowledge Management
Network information flow : limits and achievability
DSpace at IIT Bombay
View Archive Info| Field | Value | |
| Title |
Network information flow : limits and achievability
|
|
| Creator |
BORADE, SP
|
|
| Description |
An information theoretic upper bound on the information flow in discrete memoryless networks is found. The networks considered here can have multiple information sources and multiple sinks corresponding to each of the sources (which is also called as multicast). In the special case of networks with a single information source with multiple sinks, the bound coincides with the achievable region given in [1], and thus proves the optimality of the coding scheme proposed in it.
|
|
| Publisher |
IEEE
|
|
| Date |
2011-10-26T23:38:09Z
2011-12-15T09:12:36Z 2011-10-26T23:38:09Z 2011-12-15T09:12:36Z 2002 |
|
| Type |
Proceedings Paper
|
|
| Identifier |
ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS,139-139
0-7803-7501-7 http://dspace.library.iitb.ac.in/xmlui/handle/10054/16167 http://hdl.handle.net/100/2775 |
|
| Source |
IEEE International Symposium on Information Theory,LAUSANNE, SWITZERLAND,JUN 30-JUL 05, 2002
|
|
| Language |
English
|
|