The error exponent for the noiseless encoding of finite ergodic Markov sources
From MaRDI portal
Publication:3955265
DOI10.1109/TIT.1981.1056377zbMath0492.94006MaRDI QIDQ3955265
Lee D. Davisson, Giuseppe Longo, Andrea Sgarro
Publication date: 1981
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
information divergencesergodic finite alphabet Markov sourcen- sequencesweak universal coding result
Related Items
Bounds on Data Compression Ratio with a Given Tolerable Error Probability, A lower bound on the quantum capacity of channels with correlated errors, On the VC-Dimension of Binary Codes, Entropy at a weight-per-symbol and embeddings of Markov chains, An Elementary Derivation of the Large Deviation Rate Function for Finite State <scp>M</scp>arkov Chains, The asymptotic equipartition property in reinforcement learning and its relation to return maximization, An upper bound for the largest Lyapunov exponent of a Markovian product of nonnegative matrices
