Interval and recency rank source coding: Two on-line adaptive variable-length schemes
- 1 January 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 33 (1), 3-10
- https://doi.org/10.1109/tit.1987.1057251
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Evolvable Systems: From Biology to HardwareLecture Notes in Computer Science, 2000
- Dynamic huffman codingJournal of Algorithms, 1985
- Parallel algorithms for data compressionJournal of the ACM, 1985
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985
- Minimax optimal universal codeword setsIEEE Transactions on Information Theory, 1983
- Linear Algorithm for Data Compression via String MatchingJournal of the ACM, 1981
- A source matching approach to finding minimax codesIEEE Transactions on Information Theory, 1980
- Minimax codes for finite alphabets (Corresp.)IEEE Transactions on Information Theory, 1978
- On the Complexity of Finite SequencesIEEE Transactions on Information Theory, 1976
- Minimum times and memories needed to compute the values of a functionJournal of Computer and System Sciences, 1974