Low-complexity sequential lossless coding for piecewise-stationary memoryless sources
Authors:
- N. MerhavNMN. Merhav
- 1 July 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 45 (5) , 1498-1519
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- On the average redundancy rate of the Lempel-Ziv codeIEEE Transactions on Information Theory, 1997
- Redundancy of the Lempel-Ziv incremental parsing ruleIEEE Transactions on Information Theory, 1997
- A strong version of the redundancy-capacity theorem of universal codingIEEE Transactions on Information Theory, 1995
- On the minimum description length principle for sources with piecewise constant parametersIEEE Transactions on Information Theory, 1993
- Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithmIEEE Transactions on Information Theory, 1992
- Design and analysis of dynamic Huffman codesJournal of the ACM, 1987
- Universal coding, information, prediction, and estimationIEEE Transactions on Information Theory, 1984
- The performance of universal encodingIEEE Transactions on Information Theory, 1981
- Variations on a theme by HuffmanIEEE Transactions on Information Theory, 1978
- Compression of individual sequences via variable-rate codingIEEE Transactions on Information Theory, 1978