Abstract
We study exponential-server timing channels, in which the transmitter encodes a message using a sequence of packet inter-arrival times and the receiver observes the corresponding inter-departure times from an exponential-server queue. We show that if the service rate of one such queue is faster than that of another, then the latter channel is stochastically degraded with respect to the former. This combined with Burke’s theorem implies that the slower queue is more entropy increasing than the first. These facts put together provide a converse for the secrecy capacity of the wiretapped version of the channel, matching an earlier achievability result in the literature.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
