On the Minimum Delay of Block Interleaver for Batched Network Codes
Refereed conference paper presented and published in conference proceedings

Times Cited
Web of Science1WOS source URL (as at 15/01/2021) Click here for the latest count
Altmetrics Information

Other information
AbstractBatched network coding is a practical realization of random linear network coding, which encodes the packets for transmission into small batches of coded packets. The advantage of network coding can be reduced when a burst loss occurs. Block interleaver is one of the approach to spread the burst across multiple batches. However, an intermediate node has to receive all the packets in a batch which are not dropped by the channel before it can perform recoding on the batch, which means that the node has to deinterleave for recoding and reinterleave again for transmission. This gives us the freedom to select heterogeneous interleaver depth among the intermediate nodes. In general, the larger the interleaver depth, the better the spread of the bursts. On the other hand, we want the delay as short as possible to enable real-time applications. In this paper, we investigate the delay induced by applying a block interleaver on batched network codes. We also show that a homogeneous interleaver depth is the largest interleaver depth we can use to achieve a minimum delay.
All Author(s) ListHoover H. F. Yin, Ka Hei Ng, Xishi Wang, Qi Cao
Name of Conference2019 IEEE International Symposium on Information Theory (ISIT)
Start Date of Conference07/07/2019
End Date of Conference12/07/2019
Place of ConferenceParis
Country/Region of ConferenceFrance
Proceedings Title2019 IEEE International Symposium on Information Theory (ISIT)
Pages1957 - 1961
LanguagesEnglish-United Kingdom
Web of Science Subject CategoriesComputer Science, Information Systems;Computer Science, Theory & Methods;Computer Science

Last updated on 2021-15-01 at 23:21