Cart (Loading....) | Create Account
Close category search window
 

Robust decoding for timing channels

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)
Sundaresan, R. ; Dept. of Electr. Eng., Princeton Univ., NJ, USA ; Verdu, S.

To transmit information by timing arrivals to a single-server queue, we consider using the exponential server channel's maximum likelihood decoder. For any server with service times that are stationary and ergodic with mean 1/μ seconds, we show that the rate e -1μ nats per second (capacity of the exponential server timing channel) is achievable using this decoder. We show that a similar result holds for the timing channel with feedback. We also show that if the server jams communication by adding an arbitrary amount of time to the nominal service time, then the rate e-1μ1μ2/(μ12) nats per second is achievable with random codes, where the nominal service times are stationary and ergodic with mean 1/μ1 seconds, and the arithmetic mean of the delays added by the server does not exceed 1/μ2 seconds. This is a model of an arbitrarily varying channel where the current delay and the current input can affect future outputs. We also show the counterpart of these results for single-server discrete-time queues

Published in:

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

Date of Publication:

Mar 2000

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.