On the Fluctuations of the Single-Letter d-Tilted Sum for Binary Markov Sources

Abstract

We study the source-side single-letter d-tilted sum for a stationary binary Markov chain under Hamming distortion, induced by the single-letter Blahut--Arimoto operating point computed from the stationary marginal π. We show that this quantity inherits the same algebraic structure as in the memoryless (i.i.d.) case: the centered sum Jn(D)-nμD is exactly an affine function of the chain's occupation count Nn, and consequently all centered cumulants are independent of the distortion level D. The exact finite-n distribution therefore follows immediately from known results on occupation counts of two-state Markov chains. The genuinely new contributions of this note are (i) a closed-form expression for the finite-n variance that includes the autocorrelation factor due to memory, and (ii) the transfer-matrix representation of the cumulant generating function. The connection, if any, between this source-side quantity and the operational finite-blocklength rate-distortion function remains open.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…