1 research outputs found
On Sliding Window Approximation of Gilbert-Elliott Channel for Delay Constrained Setting
In this paper, we first provide analytical expressions for the block erasure
probability (BEP) of block codes that can recover erasures that are (1) random
with weight atmost or (2) burst with atmost consecutive erasures when
used over Gilbert-Elliott (GE) channel. The same approach is then used to come
up with tractable upper and lower bounds for the BEP over the GE channel, of
codes designed for the delay constrained sliding window (DCSW) channel model
introduced by Badr et al. This channel model permits either a single burst of
erasures or else random erasures within a sliding window of specified
length and requires recovery within a strict decoding delay constraint. Using
the upper bound for BEP, we show that the family of streaming codes developed
for the DCSW channel offer better rates in comparison with MDS codes operating
under the same conditions of delay and BEP