✦ LIBER ✦

Adaptive Coding and Prediction of Sources With Large and Infinite Alphabets

✍ Scribed by Ryabko, B.Y.; Astola, J.; Gammerman, A.

Book ID: 114641419
Publisher: IEEE
Year: 2008
Tongue: English
Weight: 265 KB
Volume: 54
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.2008.926385

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast adaptive arithmetic code for large

Fast adaptive arithmetic code for large alphabet sources with asymmetrical distributions

✍ Ryabko, B.; Rissanen, J. 📂 Article 📅 2003 🏛 IEEE 🌐 English ⚖ 304 KB

Spectral nulls and coding with large alp

Spectral nulls and coding with large alphabets

✍ Calderbank, A.R.; Mazo, J.E. 📂 Article 📅 1991 🏛 IEEE 🌐 English ⚖ 815 KB

The universality of grammar-based codes

The universality of grammar-based codes for sources with countably infinite alphabets

✍ He, D.; Yang, E. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 347 KB

Joint Universal Lossy Coding and Identif

Joint Universal Lossy Coding and Identification of Stationary Mixing Sources With General Alphabets

✍ Raginsky, M. 📂 Article 📅 2009 🏛 IEEE 🌐 English ⚖ 398 KB

On Asymptotically Optimal Methods of Pre

On Asymptotically Optimal Methods of Prediction and Adaptive Coding for Markov Sources

✍ Boris Ya. Ryabko; Flemming Topsøe 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 143 KB

The problem of predicting a sequence x 1 , x 2 , ... generated by a discrete source with unknown statistics is considered. Each letter x t+1 is predicted using information on the word x 1 x 2 • • • x t only. In fact, this problem is a classical problem which has received much attention. Its history

Sliding-Block and Random Source Coding w

Sliding-Block and Random Source Coding with Constrained Size Reproduction Alphabets

✍ Pearlman, W. 📂 Article 📅 1982 🏛 IEEE 🌐 English ⚖ 942 KB