摘要

The Heavy-Tail/Poisson and right-regular sequences are analyzed in detail and a new method for designing the two classes of sequences is presented. By introducing a monotonically decreasing and continuous function this method is extended to general sequences of degree distribution for erasure codes. Moreover, we show that the sequences of degree distribution designed by using this method satisfy the condition, proposed by Luby et al., under which the recover algorithm for erasure codes is successful with high probability. The design method of sequences of degree distribution given above is of great significance in design for LDPC codes, especially for low-density erasure codes.