By Topic

Sequential decoding for the exponential server timing channel

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
R. Sundaresan ; Dept. of Electr. Eng., Princeton Univ., NJ, USA ; S. Verdu

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

Published in:

IEEE Transactions on Information Theory  (Volume:46 ,  Issue: 2 )