Title :
Sequential decoding for the exponential server timing channel
Author :
Sundaresan, Rajesh ; Verdu, Sergio
Author_Institution :
Dept. of Electr. Eng., Princeton Univ., NJ, USA
fDate :
3/1/2000 12:00:00 AM
Abstract :
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 μ/(2e) nats per second i.e., one half of the capacity. The cutoff rate for the exponential server queue is therefore at least μ/(2u) nats per second
Keywords :
queueing theory; sequential decoding; telecommunication channels; timing; tree codes; cutoff rate; exponential server queue; exponential server timing channel; information transfer rate; sequential decoding; tree codes; upper bound; Block codes; Communication systems; Convolutional codes; Maximum likelihood decoding; Memoryless systems; Network address translation; Performance analysis; Queueing analysis; Timing; Tree data structures;
Journal_Title :
Information Theory, IEEE Transactions on
