By Topic

Zero-rate reliability of 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
$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

2 Author(s)
Wagner, A.B. ; Dept. of Electr. Eng. & Comput. Sci., Univ. of California, Berkeley, CA, USA ; Anantharam, V.

We determine the reliability function of the exponential-server timing channel (ESTC) in the limit as the data rate approaches zero. The limit shows that at low rates, the ESTC is strictly more reliable than the Poisson channel without dark current, answering a question Arikan posed in these Transactions. The proof employs a distance metric over inputs to timing channels that parallels Euclidean and Hamming distance for conventional channels. A consequence of the proof is that bounded-distance decoding, with distance measured according to this metric, is exponentially optimum for the ESTC in the low-rate regime. We also prove the straight-line bound for the channel and a bound on the reliability of timing channels with general service distributions in the limit as the data rate approaches zero.

Published in:

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