Beyond Network Equivalence
In earlier work, we described an equivalence result for network capacity. Roughly, that result is as follows. Given a network of noisy, memoryless, point-to-point channels, replace each channel by a noiseless, memoryless bit pipe of the same capacity yields a new network such that any collection of...
Main Authors: | Koetter, Ralf, Effros, Michelle, Medard, Muriel |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers
2010
|
Online Access: | http://hdl.handle.net/1721.1/59467 https://orcid.org/0000-0003-4059-407X |
Similar Items
-
Equivalent models for multi-terminal channels
by: Calmon, Flavio du Pin, et al.
Published: (2012) -
Joint scheduling and instantaneously decodable network coding
by: Traskov, Danail, et al.
Published: (2011) -
Scheduling for network coded multicast: a distributed approach
by: Heindlmaier, Michael, et al.
Published: (2010) -
Compressive sensing over networks
by: Medard, Muriel, et al.
Published: (2012) -
An algebraic watchdog for wireless network coding
by: Medard, Muriel, et al.
Published: (2010)