 
Summary: A Model for a Binary BurstNoise Channel
Based on a Finite Queue
Libo Zhong, Fady Alajaji and Glen Takahara
Department of Mathematics and Statistics
Queen's University, Kingston, Ontario K7L 3N6, Canada
Abstract  We introduce a binary communication
channel with memory whose noise is generated by
a queue of length K. The queue is operated under
two modes: uniform and nonuniform. The result
ing noise process is shown to be a stationary and er
godic Markov source of order K. Analytic expres
sions for the noise stationary distribution, capacity
and burst frequency of the uniform queuebased chan
nel are presented. For the nonuniform queuebased
channel, only numerical results are provided. Next,
the capacity and burst frequency of the uniform and
nonuniform queuebased channels are compared with
those of the nitememory Polya contagion channel
and the GilbertElliott channel.
1 Introduction
