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-boonded by a finite number. The rate of information transfer for this code is μ/(2e) nats per second, i.e., one half of the capacity. The cutoff rate for the exponential server queue is therefore at least μ/(2e) nats per second.
All Science Journal Classification (ASJC) codes
- Information Systems
- Computer Science Applications
- Library and Information Sciences