Optimal-Rate Streaming Code in the Three-Node Relay Network

In this paper, we study the three-node relay network subject to random and burst packet erasures. There is no limit to the number of random and burst erasures and the required delay is determined in a three-node relay network based on the number of erasures. A new construction of streaming codes in a threenode relay network are introduce based on generalized staggered diagonal embedding method. The construction can achieve the optimal-rate streaming code in some cases under the delay time.