By Topic

On the reliability exponent of the exponential 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
$31 $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

1 Author(s)
Arikan, E. ; Dept. of Electr. & Electron. Eng., Bilkent Univ., Ankara, Turkey

We determine the reliability exponent E(R) of the Anantharam-Verdu (see ibid., vol.42, p.4-18, Jan.1996) exponential server timing channel with service rate μ for all rates R between a critical rate Rc = (μ/4) log 2 and the channel capacity C = e-1μ. For rates between 0 and Rc, we provide a random-coding lower bound Er(R) and a sphere-packing upper bound Esp(R) on E(R). We also determine that the cutoff rate R0 for this channel equals μ/4, thus answering a question posed by Sundaresan and Verdu (see ibid., vol.46, p.705-9, Mar. 2000). An interesting aspect of our results is that the lower bound Er (R) for the reliability exponent of the timing channel coincides with Wyner's reliability exponent for the photon-counting channel with no dark current and with peak power constraint it. Whether the reliability exponents of the two channels are actually equal everywhere remains open. This shows that the exponential server timing channel is at least as reliable as this type of a photon-counting channel for all rates

Published in:

Information Theory, IEEE Transactions on  (Volume:48 ,  Issue: 6 )