Coding in the Block-Erasure Channel

Authors:
A. Guillen i Fabregas
Affiliations:
Inst. for Telecommun. Res., Univ. of South Australia, Mawson Lakes, SA, Australia
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 3

Outage exponents of block-fading channels with power allocation

IEEE Transactions on Information Theory
Low-density parity-check codes for nonergodic block-fading channels

IEEE Transactions on Information Theory
Analysis and construction of full-diversity joint network-LDPC codes for cooperative communications

EURASIP Journal on Wireless Communications and Networking - Special issue on physical-layer network coding for wireless cooperative networks

Quantified Score

Hi-index	754.96

Visualization

Abstract

In this correspondence, we study an M-ary block-erasure channel with B blocks, where with probability epsi 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.