DocumentCode :
3513544
Title :
A pairwise error probability bound for the exponential- server timing channel
Author :
Wagner, Aaron B. ; Anantharam, Venkat
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA
Volume :
5
fYear :
2003
fDate :
11-15 May 2003
Firstpage :
3472
Abstract :
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.
Keywords :
channel capacity; codes; error statistics; queueing theory; telecommunication network reliability; Poisson channel; codewords; exponential-server timing channel; low rates codes; pairwise error probability; reliability function; zero dark current; Block codes; Channel capacity; Context; Costs; Dark current; Decoding; Network address translation; Pairwise error probability; Timing; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, 2003. ICC '03. IEEE International Conference on
Print_ISBN :
0-7803-7802-4
Type :
conf
DOI :
10.1109/ICC.2003.1204100
Filename :
1204100
Link To Document :
بازگشت