A criticism of the ACW algorithm

DOI10.1016/J.CAMWA.2012.06.024MaRDI QIDQ356211zbMATH OpenOpenAlexFDO

Authors M. Saleh Mohammadi, Ali Naserasadi

Publication date 25 July 2013

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.camwa.2012.06.024

zbMATH Keywords

ACW algorithmdata compressionHuffman algorithm

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2087906
• A critique of numerical analysis
• Beyond the Worst-Case Analysis of Algorithms
• A remark on the alternating algorithm
• A counterexample to a global optimization algorithm
• scientific article; zbMATH DE number 89008
• Difficulties in the evaluation of solving algorithms
• A critical analysis of the “improved Clarke and Wright savings algorithm”
• scientific article; zbMATH DE number 952460

Cites work

• A concise introduction to data compression.
• A Method for the Construction of Minimum-Redundancy Codes
• An adaptive character wordlength algorithm for data compression
• Data compression. The complete reference.
• scientific article; zbMATH DE number 5834960 (Why is no real title available?)

This page was built for publication: A criticism of the ACW algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q356211)