  This paper presents a new construction of error correcting codes which
achieves optimal recovery of a streaming source over a packet erasure channel.
The channel model considered is the sliding window erasure model, with burst
and arbitrary losses, introduced by Badr et al. . Recently, two independents
works by Fong et al. and Krishnan and Kumar have identified optimal streaming
codes within this framework. In this paper, we introduce streaming code when
the rate of the code is at least 1/2. Our proposed construction is explicit and
systematic, uses off-the-shelf maximum distance separable (MDS) codes and
maximum rank distance (MRD) Gabidulin block codes as constituent codes and
achieves the optimal error correction. It presents a natural generalization to
the construction of Martinian and Sundberg to tolerate an arbitrary number of
sparse erasures. The field size requirement which depends on the constituent
MDS and MRD codes is also analyzed.
