English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The exponential server timing channel is known to be the simplest, and insome sense canonical, queuing timing channel. The capacity of thisinfinite-memory channel is known. Here, we discuss practical finite-lengthrestrictions on the codewords and attempt to understand the maximal rate thatcan be achieved for a target error probability. By using Markov chain analysis,we prove a lower bound on the maximal channel coding rate achievable atblocklength $n$ and error probability $\epsilon$. The bound is approximated by$C- n^{-1/2} \sigma Q^{-1}(\epsilon)$ where $Q$ denotes the Q-function and$\sigma^2$ is the asymptotic variance of the underlying Markov chain. A closedform expression for $\sigma^2$ is given.

Timing Channel: Achievable Rate in the Finite Block-Length Regime