Multi-alphabet universal coding of memoryless sources

zbMATH Open0901.94015MaRDI QIDQ1925351FDOQ1925351

Yu. M. Shtar'kov, Frans M. J. Willems, Tj. J. Tjalkens

Publication date: 15 December 1996

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

zbMATH Keywords

redundancymulti-alphabet universal codingsequential arithmetic codinguniversal coding of memoryless sources

Mathematics Subject Classification ID

Source coding (94A29)

Cited In (13)

• A lower bound on compression of unknown alphabets
• Coding of sources with two-sided geometric distributions and unknown parameters
• Universal coding algorithm for a family of context Markov sources
• A sequential algorithm for the universal coding of finite memory sources
• Joint matrix universal coding of sequences of independent symbols
• Large Alphabet Source Coding Using Independent Component Analysis
• Title not available (Why is that?)
• Efficient method of adaptive arithmetic coding for sources with large alphabets
• Universal coding for discrete memoryless sources uniform with respect to output
• Universal multiresolution source codes
• Aim functions and sequential estimation of the source model for universal coding
• Title not available (Why is that?)
• A universal finite memory source

   Recommendations

• Universal sequential coding of single messages 👍 👎
• A sequential algorithm for the universal coding of finite memory sources 👍 👎
• Universal coding for discrete memoryless sources uniform with respect to output 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Multi-alphabet universal coding of memoryless sources

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