Multi-alphabet universal coding of memoryless sources
From MaRDI portal
Publication:1925351
zbMATH Open0901.94015MaRDI QIDQ1925351FDOQ1925351
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)
Recommendations
redundancymulti-alphabet universal codingsequential arithmetic codinguniversal coding of memoryless sources
Cited In (23)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Universal sequential coding of single messages
- Universal Algorithms for Channel Decoding of Uncompressed Sources
- 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
- Data compression by means of a ``book stack
- A sequential algorithm for the universal coding of finite memory sources
- Title not available (Why is that?)
- Joint matrix universal coding of sequences of independent symbols
- A new method of partial generalized interval transformations for memoryless source coding
- Title not available (Why is that?)
- Large Alphabet Source Coding Using Independent Component Analysis
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- A universal finite memory source
- 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)
