Name
Abstract | ||
|---|---|---|
Operations that combine smaller networks into a larger network in a manner such that the rate region of the larger network can be directly obtained from the associated rate regions of the smaller networks are defined and presented. The operations are selected to also have the property that the sufficiency of classes of linear network codes and the tightness of the Shannon (polymatroid) outer bound are preserved in the combination. Four such operations are defined, and the classes of linear codes considered include both scalar and vector codes. It is demonstrated that these operations enable one to obtain rate regions for networks of arbitrary size, and to also determine if some classes of linear codes are sufficient and/or the Shannon outer bound bound is tight for these networks. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/ITWF.2015.7360731 | 2015 IEEE Information Theory Workshop - Fall (ITW) |
Keywords | Field | DocType |
network combination operation,linear network codes,rate region,Shannon outer bound,polymatroid outer bound | Linear network coding,Discrete mathematics,Random variable,Polymatroid,Computer science,Block code,Scalar (physics),Linear network,Theoretical computer science,Linear code,Artificial neural network | Conference |
Citations | PageRank | References |
1 | 0.35 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Congduan Li | 1 | 40 | 7.75 |
| Steven Weber | 2 | 724 | 53.55 |
| John MacLaren Walsh | 3 | 107 | 17.90 |