Sequential decoding for the exponential server timing channel
Rajesh Sundaresan, Sergio Verdú · IEEE Transactions on Information Theory · 2000
We show the existence of a good tree code with a sequential decoder for the exponential server timing channel. The expected number of computations before moving one step ahead is upper-bounded by a finite number. The rate of information transfer for this code is /spl mu//(2e) nats per second i.e., one half of the capacity. The cutoff rate for the exponential server queue is therefore at least /spl mu//(2u) nats per second.