Optimizing low density parity check code for two parallel erasure links

In this paper, we solve the optimizing problem of designing Low-Density Parity Check codes for two parallel erasure links based on the known SDP approach. We show that our reformulation is suitable for this optimizing problem. Our results show that the optimal rate code design problem is a good way and worth-mentioning tool. One can extend our work to the other area.