Motivated by modern network communication applications which require low latency, we study codes that correct erasures with low decoding delay. We provide a simple explicit construction that yields convolutional codes that can correct both burst and arbitrary erasures under a maximum decoding delay constraint $T$. Our proposed code has efficient encoding/decoding algorithms and requires a field size that is linear in $T$. We study the performance of our code over the Gilbert-Elliot channel; our simulation results show significant performance gains over low-delay codes existing in the literature.

翻译：受现代网络通信应用对低延迟需求的驱动，本文研究具有低解码延迟的擦除纠正码。我们提出一种简单的显式构造方法，可生成在最大解码延迟约束 $T$ 下同时纠正突发擦除和任意擦除的卷积码。所提码具有高效的编解码算法，且所需域大小与 $T$ 成线性关系。我们研究了该码在吉尔伯特-埃利奥特信道上的性能；仿真结果表明，与现有文献中的低延迟码相比，该码获得了显著的性能增益。