Coding in the Block-Erasure Channel
Albert Guillén i Fàbregas · IEEE Transactions on Information Theory · 2006
In this correspondence, we study an$M$-ary block-erasure channel with$B$blocks, where with probability$epsilon $a block of$L$coded symbols is erased. The behavior of the error probability of coded systems over such channels is studied, and we show that, if the code is diversity-wise maximum-distance separable, its word error probability is equal to the outage probability, which admits a very simple expression. This correspondence is intended to complement the error probability analysis in previous work by Lapidoth and shed some light on the design of coding schemes for nonergodic channels.