| 講演抄録／キーワード |
| 講演名 |
2014-10-30 13:00
［ポスター講演］Finite-Length Spatial-Temporal Network Coding
○Xiaoli Xu（NTU）・Yong Zeng（NUS）・Yong Liang Guan（NTU） |
| 抄録 |
（和） |
The throughput of erasure networks with finite-length spatial-temporal network coding is analyzed. The derived analytical results are shown to match well with the simulation values. The results indicate that given M and erasure probability p, the throughput is mainly determined by the min-cut value k, the number of minimum cuts N, and the number of critical edges L of the network. One practical application of the obtained results is to determine the minimum temporal coding size M needed to achieve a target throughput for a given erasure network. |
| （英） |
The throughput of erasure networks with finite-length spatial-temporal network coding is analyzed. The derived analytical results are shown to match well with the simulation values. The results indicate that given M and erasure probability p, the throughput is mainly determined by the min-cut value k, the number of minimum cuts N, and the number of critical edges L of the network. One practical application of the obtained results is to determine the minimum temporal coding size M needed to achieve a target throughput for a given erasure network. |
| キーワード |
（和） |
Network coding / Finite coding length / Throughput / / / / / |
| （英） |
Network coding / Finite coding length / Throughput / / / / / |
| 文献情報 |
信学技報 |
| 資料番号 |
|
| 発行日 |
|
| ISSN |
|
| PDFダウンロード |
|