Low delay random linear coding over a stream

We introduce a random linear code construction for erasure packet channel. We then analyze its in-order delivery delay behavior. We show that for rates below the capacity, the mean in-order-delivery delay of our scheme is better than the mean delay introduced by the scheme which implements the random linear block coding. We also compute the decoding failure probability and encoding and decoding complexity of our scheme.