On packet lengths and overhead for random linear coding over the erasure channel - Computer Science Information TheoryReportar como inadecuado




On packet lengths and overhead for random linear coding over the erasure channel - Computer Science Information Theory - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: We assess the practicality of random network coding by illuminating the issueof overhead and considering it in conjunction with increasingly long packetssent over the erasure channel. We show that the transmission of increasinglylong packets, consisting of either of an increasing number of symbols perpacket or an increasing symbol alphabet size, results in a data rateapproaching zero over the erasure channel. This result is due to an erasureprobability that increases with packet length. Numerical results for aparticular modulation scheme demonstrate a data rate of approximately zero fora large, but finite-length packet. Our results suggest a reduction in theperformance gains offered by random network coding.



Autor: Brooke Shrader, Anthony Ephremides

Fuente: https://arxiv.org/







Documentos relacionados