By Topic

A pairwise error probability bound 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)
A. B. Wagner ; Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA ; V. Anantharam

We exhibit upper and lower bounds on the pairwise error probability of the exponential-server timing channel in terms of an appropriately-defined distance between codewords. We show that this distance plays a crucial role in determining the reliability function at low rates. In particular, by lower bounding the minimum distance of good-low rates codes, we provide an improved lower bound on the reliability function of the channel at rate zero. This improved bound proves that at low rates, the exponential-server timing channel is strictly more reliable than the related Poisson channel with zero dark current, answering an open question posed by Arikan. Some remarks are also made about using the results of this paper to prove an improved upper bound on the reliability function at rate zero.

Published in:

Communications, 2003. ICC '03. IEEE International Conference on  (Volume:5 )

Date of Conference:

11-15 May 2003