Universal variable-to-fixed length source codes for Markov sources
| Autor: | Sanjeev R. Kulkarni, K. Visweswariah |
|---|---|
| Rok vydání: | 2002 |
| Předmět: |
Block code
Prefix code Discrete mathematics Markov chain Polynomial code Computer science Variable-order Markov model Concatenated error correction code Variable-length code Markov process Locally testable code Markov model Linear code Error exponent Systematic code symbols.namesake Universal code Cyclic code Fountain code symbols Constant-weight code Low-density parity-check code Hamming code Algorithm |
| Zdroj: | Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252). |
| DOI: | 10.1109/isit.1998.708628 |
| Popis: | A universal variable-to-fixed length code for the class of Markov sources with finite output alphabets is considered. The performance of the code for large dictionary sizes is investigated and it is shown that the code is optimal in the sense that no codes exist that have better asymptotic performance. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|