Burst Erasure Correcting Codes for Carousel Transmission

In several broadcast communication systems, information is repeatedly transmitted with a carousel strategy, i.e., a given codeword is replicated in consecutive frames. When the channel experiences erasure bursts and reception is asynchronous, it becomes important to consider end-around erasure bursts. In this paper, we find the conditions under which a given code is able to correct burst of erasures whenever end-around bursts are taken into consideration. We also describe a constructive algorithm to build a code parity-check matrix with the desired properties.