Name
Abstract | ||
|---|---|---|
Random linear network coding (RLNC) is a promising network coding solution when the network topology information is not fully available to all the nodes. However, in practice, nodes have partial knowledge of the network topology information. Motivated by this, we investigate the performance of RLNC and obtain different upper bounds on the failure probability of RLNC for the network constrained by ... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/TCOMM.2017.2787991 | IEEE Transactions on Communications |
Keywords | Field | DocType |
Network coding,Network topology,Upper bound,Encoding,Peer-to-peer computing,Performance analysis,Decoding | Linear network coding,Upper and lower bounds,Computer science,Control theory,Infinity,Peer to peer computing,Theoretical computer science,Network topology,Decoding methods,Asymptotic analysis,Encoding (memory) | Journal |
Volume | Issue | ISSN |
66 | 5 | 0090-6778 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dan Li | 1 | 0 | 0.68 |
| Xuan Guang | 2 | 0 | 2.70 |
| Zhiheng Zhou | 3 | 43 | 23.53 |
| Congduan Li | 4 | 40 | 7.75 |
| Chee Wei Tan | 5 | 1369 | 92.01 |