Rate-Optimal Streaming Codes over Small Finite Fields for Burst/Random Erasure Channels

Streaming codes provide reliable low-latency communication over the packet erasure channels. In the sliding window channel model, the maximum number of erasures and the maximum length of the burst erasure are given for an arbitrary sliding window of a fixed length. This paper presents an explicit construction of a rate-optimal streaming code over small finite fields for the sliding window channels.