scientific article; zbMATH DE number 524372

MaRDI QIDQ4284863zbMATH OpenFDO

Authors Bin Yu

Publication date 24 March 1994

zbMATH Keywords

continuous Lipschitz class of \((d-1)\)-order Markov chainsexpected redundancyKullback- Leibler density estimation errorLipschitz Markov sourcesnonasymptotic minimax lower boundnonexistence of universal per symbol expected redundancy rateprefix code

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Bounds on codes (94B65) Error probability in coding theory (94B70)

Recommendations

• Lower bounds on expected redundancy for nonparametric classes
• Minimax noiseless universal coding for Markov sources
• Universal redundancy rates do not exist
• A strong version of the redundancy-capacity theorem of universal coding
• Markov Types and Minimax Redundancy for Markov Sources

Cited in

(7)

• Minimax noiseless universal coding for Markov sources
• A combinatorial problem arising in information theory: Precise minimax redundancy for Markov sources
• The asymptotic redundancy of Bayes rules for Markov chains
• Universal redundancy rates for the class of B-processes do not exist
• Lower bounds on expected redundancy for nonparametric classes
• Average Redundancy of the Shannon Code for Markov Sources
• The effect of redundancy on probability bounds

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4284863)