An adaptive character wordlength algorithm for data compression

DOI10.1016/J.CAMWA.2007.05.014zbMath1149.68382OpenAlexW2088603609MaRDI QIDQ931760

Shakir M. Hussain, Hussein Al-Bahadili

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

zbMATH Keywords

data compressionbinary codescodingHuffman coding

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (3)

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

• Algorithm 673

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

This page was built for publication: An adaptive character wordlength algorithm for data compression