Modified earliest decoding in networks that implement random linear network coding

Abstract

In this paper we present a formalised description of Modified Earliest Decoding. We simulate the performance of the method in comparison with Earliest Decoding in networks that implement random linear network coding. We show that Modified Earliest Decoding has a smaller decoding complexity than Earliest Decoding and Gaussian Elimination as well as a smaller decoding delay