Multi-alphabet universal coding of memoryless sources

MaRDI QIDQ1925351zbMATH OpenFDO

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

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)

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
• scientific article; zbMATH DE number 4095371

Cited in

(26)

• A universal finite memory source
• scientific article; zbMATH DE number 6460053 (Why is no real title available?)
• scientific article; zbMATH DE number 3478758 (Why is no real title available?)
• Polynomial asymptotically optimal coding of underdetermined Bernoulli sources of the general form
• scientific article; zbMATH DE number 4095371 (Why is no real title available?)
• Universal sequential coding of single messages
• Adaptive compression against a countable alphabet
• Universal coding for memoryless sources with countably infinite alphabets
• Universal Algorithms for Channel Decoding of Uncompressed Sources
• A lower bound on compression of unknown alphabets
• Universal coding algorithm for a family of context Markov sources
• Coding of sources with two-sided geometric distributions and unknown parameters
• Data compression by means of a ``book stack
• A sequential algorithm for the universal coding of finite memory sources
• scientific article; zbMATH DE number 3557667 (Why is no real title available?)
• Joint matrix universal coding of sequences of independent symbols
• A new method of partial generalized interval transformations for memoryless source coding
• scientific article; zbMATH DE number 3700709 (Why is no real title available?)
• Large Alphabet Source Coding Using Independent Component Analysis
• scientific article; zbMATH DE number 1811356 (Why is no real title available?)
• On a class of multilevel universal source coding schemes
• 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
• Twice-universal coding

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)