Universal sequential coding of single messages

From MaRDI portal

Revision as of 02:29, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1112787

Jump to:navigation, search

zbMath0659.94009MaRDI QIDQ1112787

Yu. M. Shtar'kov

Publication date: 1988

Published in: Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

Markov chains Markov sources coding redundancy of single messages memoryless sources sequential coding of messages

Mathematics Subject Classification ID

Source coding (94A29)

Related Items (6)

Statistical Problem Classes and Their Links to Information Theory ⋮ Predicting a binary sequence almost as well as the optimal biased coin ⋮ A lower bound on compression of unknown alphabets ⋮ Adaptive game playing using multiplicative weights ⋮ Number of hidden states and memory: a joint order estimation problem for Markov chains with Markov regime ⋮ Relative expected instantaneous loss bounds

This page was built for publication: Universal sequential coding of single messages

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1112787&oldid=13155828"