A detailed study of loss-resilient codes based on random bipartite graphs are made in this paper.We propose the upper bound on the maximum tolerable loss fraction δ for which the decoding of the loss-resilient code with a given degree distribution pair is successfull.The algorithm to find the degree distribution pair of loss-resilient codes is presented by making a detailed analysis of this upper bound.This result shows that codes constructed from degree distribution pair obtained by the algorithm above should perform better than the degree distribution pair given in [2].Moreover

we prove loss-resilient code with the definite degree distribution pair can be both encoded and decoded successfully in linear time.