Increasing the Huffman generation code algorithm to equalize compression ratio and time in lossless 16-bit data archiving
- 2 December 2022
- journal article
- research article
- Published by Springer Science and Business Media LLC in Multimedia Tools and Applications
- Vol. 82 (16), 24031-24068
- https://doi.org/10.1007/s11042-022-14130-1
Abstract
No abstract availableKeywords
This publication has 62 references indexed in Scilit:
- Large-Scale Vector Data Visualization using High Performance ComputingJournal of Software, 2011
- ErrataResonance, 2006
- An efficient decoding technique for Huffman codesInformation Processing Letters, 2002
- A memory-efficient and fast Huffman decoding algorithmInformation Processing Letters, 1999
- Huffman code efficiencies for extensions of sourcesIEEE Transactions on Communications, 1995
- Memory efficient and high-speed search Huffman codingIEEE Transactions on Communications, 1995
- The length of a typical Huffman codewordIEEE Transactions on Information Theory, 1994
- A locally adaptive data compression schemeCommunications of the ACM, 1986
- Dynamic huffman codingJournal of Algorithms, 1985
- A universal algorithm for sequential data compressionIEEE Transactions on Information Theory, 1977