An adaptive character wordlength algorithm for data compression
From MaRDI portal
Publication:931760
DOI10.1016/j.camwa.2007.05.014zbMath1149.68382MaRDI QIDQ931760
Hussein Al-Bahadili, Shakir M. Hussain
Publication date: 26 June 2008
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2007.05.014
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
Related Items
A criticism of the ACW algorithm, Error detection in arithmetic coding with artificial markers, A novel lossless data compression scheme based on the error correcting Hamming codes
Uses Software
Cites Work
- A nearly-optimal Fano-based coding algorithm
- A fast and efficient nearly-optimal adaptive Fano coding scheme
- Dynamic huffman coding
- Design and analysis of dynamic Huffman codes
- Data compression
- A universal algorithm for sequential data compression
- Compression of individual sequences via variable-rate coding
- Algorithm 673
- A Method for the Construction of Minimum-Redundancy Codes