Date Added: Apr 2011
In many applications erasure correcting codes are used to recover packet losses at high protocol stack layers. The objects (e.g. files) to be transmitted often have variable sizes, resulting in a variable number of packet to be encoded by the packet-level encoder. In this paper, algorithms for the (online) flexible design of parity-check matrices for irregular-repeat-accumulate codes are investigated. The proposed algorithms allow designing in fast manner parity-check matrices that are suitable for low-complexity maximum-likelihood decoding.