An efficient fault-tolerant communication algorithm is essential to enhance the performance simple and optimal fault-tolerant broadchasting algorithms in the presence of at most n-L link of node faults in an n-dimensional hypercube. nodes are are also considered. These algorithms are optimal os close to optimal in terms of the number of communication steps.